일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | |
7 | 8 | 9 | 10 | 11 | 12 | 13 |
14 | 15 | 16 | 17 | 18 | 19 | 20 |
21 | 22 | 23 | 24 | 25 | 26 | 27 |
28 | 29 | 30 | 31 |
Tags
- Python
- Python Implementation
- 운영체제
- LeetCode
- 43. Multiply Strings
- Convert Sorted List to Binary Search Tree
- Generator
- 315. Count of Smaller Numbers After Self
- Protocol
- Python Code
- Decorator
- data science
- attribute
- iterator
- t1
- kaggle
- 프로그래머스
- Regular Expression
- concurrency
- shiba
- 시바견
- Class
- 715. Range Module
- 109. Convert Sorted List to Binary Search Tree
- 30. Substring with Concatenation of All Words
- 컴퓨터의 구조
- 파이썬
- 밴픽
- Substring with Concatenation of All Words
- DWG
Archives
- Today
- Total
목록384. Shuffle an Array (1)
Scribbling
LeetCode: 384. Shuffle an Array
Refer to the below post for Knuth Shuffle. https://focalpoint.tistory.com/253 Shuffle Algorithm: Knuth Shuffle This post is about Knuth Shuffle, a shuffle algorithm. - This algorithm allows random shuffle, giving all permuations of array equal likelihood. - No need for additional arrays, so memory complexity.. focalpoint.tistory.com class Solution: def __init__(self, nums: List[int]): self.nums ..
Computer Science/Coding Test
2022. 1. 15. 23:02