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