일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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
- shiba
- Generator
- LeetCode
- Python Implementation
- DWG
- concurrency
- Class
- 프로그래머스
- 운영체제
- t1
- Regular Expression
- 밴픽
- 715. Range Module
- 시바견
- Substring with Concatenation of All Words
- Protocol
- data science
- Python Code
- Decorator
- 315. Count of Smaller Numbers After Self
- 파이썬
- Python
- iterator
- kaggle
- 30. Substring with Concatenation of All Words
- attribute
- 109. Convert Sorted List to Binary Search Tree
- Convert Sorted List to Binary Search Tree
- 43. Multiply Strings
- 컴퓨터의 구조
Archives
- Today
- Total
목록시바 (1)
Scribbling
LeetCode: 31. Next Permutation
class Solution: def nextPermutation(self, nums: List[int]) -> None: i = len(nums) - 1 while i - 1 >= 0 and nums[i-1] >= nums[i]: i -= 1 if i == 0: return nums.sort() swap_idx, swap_val = None, int(1e9) for j in range(i, len(nums)): if nums[j] > nums[i-1] and nums[j] < swap_val: swap_val = nums[j] swap_idx = j nums[i-1], nums[swap_idx] = nums[swap_idx], nums[i-1] nums[i:] = sorted(nums[i:])
Computer Science/Coding Test
2021. 9. 9. 22:40