| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 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 |
- nodeJS
- 비트연산
- count
- priority_queue
- route
- component
- event
- map
- queue
- Context
- server
- DP
- array
- state
- UE5
- routes
- bit
- treenode
- Props
- axios
- leetcode
- Callback
- MySQL
- c++
- css
- node.js
- React
- BinaryTree
- Navigation
- JSX
- Today
- Total
목록DP (3)
우사미 코딩
1. 문제링크 https://leetcode.com/problems/longest-arithmetic-subsequence Longest Arithmetic Subsequence - LeetCode Can you solve this real interview question? Longest Arithmetic Subsequence - Given an array nums of integers, return the length of the longest arithmetic subsequence in nums. Note that: * A subsequence is an array that can be derived from another array by leetcode.com 2. 키포인트 - dp사용한다. ..
1. 링크 https://leetcode.com/problems/longest-common-subsequence/ Longest Common Subsequence - LeetCode Can you solve this real interview question? Longest Common Subsequence - Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0. A subsequence of a string is a new string genera leetcode.com 2. 키포인트 dp를 사용하여 현재 text1[..
1. 문제링크 https://leetcode.com/problems/coin-change/ Coin Change - LeetCode Can you solve this real interview question? Coin Change - You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make leetcode.com dp는 동적 계획법인데, 이것은 복잡한 문제를 간단한 여러 개의 문제로 나누어 푸는 방법이다 dp..