💻 Jihun's Ifuwanna IT :: Tech Blog 😃
동적프로그래밍 검색 결과

해당 글 4건

[LeetCode] 740. Delete and Earn - 문제풀이

Description 주어진 배열에서 아래 작업을 여러 번 수행하여 얻는 최대 점수를 반환하는 문제입니다. You are given an integer array nums. You want to maximize the number of points you get by performing the following operation any number of times: Pick any nums[i] and delete it to earn nums[i] points. Afterwards, you must delete every element equal to nums[i] - 1 and every element equal to nums[i] + 1. Return the maximum number of point..
알고리즘/LeetCode 2022. 3. 5. 21:13

[LeetCode] 799. Champagne Tower - 문제풀이

Description 피라미드 형태로 쌓인 컵에 샴페인을 붓는다고 가정할때 주어진 위치의 컵에 담긴 샴페인의 양을 반환하는 문제입니다. We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Each glass holds one cup of champagne. Then, some champagne is poured into the first glass at the top. When the topmost glass is full, any excess liquid poured will fall equally to the glass immedi..
알고리즘/LeetCode 2022. 3. 5. 20:03

[LeetCode] 198. House Robber - 문제풀이

Description 주어진 배열에서 연속된 위치의 값은 훔칠 수 없는 점을 감안하여 최대로 훔칠 수 있는 금액을 계산하는 문제입니다. You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on ..
알고리즘/LeetCode 2022. 2. 5. 01:11

[LeetCode] 70. Climbing Stairs - 문제풀이

Description n높이의 계단을 1또는 2스텝을 한 번에 오를 수 있다고 가정할때 top으로 올라갈 수 있는 경우의 수를 계산하는 문제입니다. You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Output: 2 Explanation: There are two ways to climb to the top. 1. 1 step + 1 step 2. 2 steps Example 2: Input: n = 3 Output: 3 Ex..
알고리즘/LeetCode 2022. 2. 5. 00:09