💻 Jihun's Ifuwanna IT :: Tech Blog 😃
dynamic programming 검색 결과

해당 글 7건

[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] 120. Triangle - 문제풀이

Description 주어진 삼각형형태의 array 목록에서 맨아래로 갈 수 있는 최단거리를 반환하는 문제입니다. Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row. Example 1: Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]] Output: 11 Expl..
알고리즘/LeetCode 2022. 2. 6. 13:01

[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

[LeetCode] 118. Pascal's Triangle - 문제풀이

Description 배열을 이용하여 파스칼의 삼각형(Pascal's Triangle)을 구현하는 문제입니다. Given an integer numRows, return the first numRows of Pascal's triangle. In Pascal's triangle, each number is the sum of the two numbers directly above it as shown: Example 1: Input: numRows = 5 Output: [[1],[1,1],[1,2,1],[1,3,3,1],[1,4,6,4,1]] Example 2: Input: numRows = 1 Output: [[1]] Constraints: 1
알고리즘/LeetCode 2022. 1. 21. 16:48

[LeetCode] 121. Best Time to Buy and Sell Stock - 문제풀이

Description 주어진 일자별 주식 가격이 기재된 배열에서 가장 큰 이익을 남길 수 있는 경우의 수를 계산하여 반환하는 문제입니다. You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any ..
알고리즘/LeetCode 2022. 1. 20. 23:33

[LeetCode] 542. 01 Matrix - 문제풀이

Description 0부터의 거리를 나타내도록 행렬표를 업데이트 하는 문제입니다. Given an m x n binary matrix mat, return the distance of the nearest 0 for each cell. The distance between two adjacent cells is 1. Example 1: Input: mat = [[0,0,0],[0,1,0],[0,0,0]] Output: [[0,0,0],[0,1,0],[0,0,0]] Example 2: Input: mat = [[0,0,0],[0,1,0],[1,1,1]] Output: [[0,0,0],[0,1,0],[1,2,1]] Constraints: m == mat.length n == mat[i].length 1 =..
알고리즘/LeetCode 2022. 1. 14. 17:00