leetcode

💡  오늘의 학습 키워드더보기더보기📌  이분 탐색 문제 설명문제 링크 : https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/A conveyor belt has packages that must be shipped from one port to another within days days.The ith package on the conveyor belt has a weight of weights[i]. Each day, we load the ship with packages on the conveyor belt (in the order given by weights). We may not load more weight than ..

💡  오늘의 학습 키워드더보기📌  동적 프로그래밍 문제 설명문제 링크 : https://leetcode.com/problems/count-square-submatrices-with-all-ones/Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.제한 사항1. 1 2. 1 3. 0  문제 회고💡 어떤 문제가 있었고, 나는 어떤 시도를 했는지 그리고 새롭게 안 사실은 무엇인지dp로 풀지 않으면 시간 복잡도 문제를 해결할 수 없는 문제였습니다. 문제 풀이 과정보다 풀이 아이디어를 생각하는게 중요했던 문제이고, DP 배열은 다음과 같이 정의됩니다.DP 배열은 dp[i][j]로 주어진 matrix와..

💡  오늘의 학습 키워드더보기📌  동적 프로그래밍 문제 설명문제 링크 : https://leetcode.com/problems/partition-array-for-maximum-sum/Given an integer array `arr`, partition the array into (contiguous) subarrays of length at most k. After partitioning, each subarray has their values changed to become the maximum value of that subarray. Return the largest sum of the given array after partitioning. Test cases are generated so..

💡 오늘의 학습 키워드더보기📌  완전 이진 트리📌  재귀📌  동적 프로그래밍 문제 설명문제 링크 : https://leetcode.com/problems/all-possible-full-binary-trees/description/Given an integer n, return a list of all possible full binary trees with n nodes. Each node of each tree in the answer must have Node.val == 0.Each element of the answer is the root node of one possible tree. You may return the final list of trees in any order.A fu..

💡 오늘의 학습 키워드더보기📌  완전 이진 트리 문제 설명문제 링크 : https://leetcode.com/problems/reverse-odd-levels-of-binary-tree/Given the root of a perfect binary tree, reverse the node values at each odd level of the tree.For example, suppose the node values at level 3 are [2,1,3,4,7,11,29,18], then it should become [18,29,11,7,4,3,1,2].Return the root of the reversed tree.A binary tree is perfect if all parent node..