jmmm_25

문제 출처: leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/ Partitioning Into Minimum Number Of Deci-Binary Numbers - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com deci-binary란 0으로 시작하지 않는 0과 1로 이루어진 값이다. 32는 10 + 11 + 11 의 구성으로 이루어진 deci-binary로 표현을 할 수..

출처: https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation/ Find Positive Integer Solution for a Given Equation - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 주어진 function_id에 대해서만 잘 처리하면 되는 문제이다. 쉬운 문제 #include #include using namespace std; // This is..

출처: https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/ Maximum Nesting Depth of Two Valid Parentheses Strings - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 처음에 문제가 이해가 잘 안되어서 힘들었던 문제이다. 문제에서 아래 나와있는 depth 개념이 중요하다. depth를 최소화 할 수 있는 그룹핑을 만들면 된..

문제 출처 : https://leetcode.com/problems/subrectangle-queries/ Subrectangle Queries - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 기본문제이며, 소스 코드를 보면 바로 이해할 수 있는 문제다. /** * Your SubrectangleQueries object will be instantiated and called as such: * SubrectangleQueries* obj = new Subr..