| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
Tags
- attribute
- 109. Convert Sorted List to Binary Search Tree
- 시바견
- Python
- 715. Range Module
- Convert Sorted List to Binary Search Tree
- Decorator
- data science
- kaggle
- t1
- 30. Substring with Concatenation of All Words
- Protocol
- iterator
- 운영체제
- 밴픽
- Generator
- Substring with Concatenation of All Words
- concurrency
- 315. Count of Smaller Numbers After Self
- 파이썬
- Python Implementation
- 컴퓨터의 구조
- LeetCode
- 프로그래머스
- DWG
- shiba
- Regular Expression
- Python Code
- Class
- 43. Multiply Strings
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