| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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
- 109. Convert Sorted List to Binary Search Tree
- shiba
- 파이썬
- 프로그래머스
- 밴픽
- 30. Substring with Concatenation of All Words
- Regular Expression
- kaggle
- Python Code
- 315. Count of Smaller Numbers After Self
- Convert Sorted List to Binary Search Tree
- 운영체제
- 컴퓨터의 구조
- Substring with Concatenation of All Words
- DWG
- Python Implementation
- attribute
- data science
- Generator
- LeetCode
- iterator
- 시바견
- Python
- Class
- 715. Range Module
- Decorator
- concurrency
- 43. Multiply Strings
- t1
- Protocol
Archives
- Today
- Total
목록Increasing Triplet Subsequence (1)
Scribbling
LeetCode: 334. Increasing Triplet Subsequence
This problem is a special case of #300, which is LIS. Refer to LIS algorithm here. https://focalpoint.tistory.com/179 LeetCode: 300. Longest Increasing Subsequence - 시바견의 끄적임 1. 가장 간단한 DP 형태 O(N**2)이다. class Solution: def lengthOfLIS(self, nums: List[int]) -> int: dp = [0] * len(nums) dp[0] = 1 for i in range(1, len(nums)): temp = -1 j = i - 1 while j >= 0: if n.. focalpoint.tistory.com class So..
Computer Science/Coding Test
2022. 1. 11. 20:38