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