728x90
๋ฐ์ํ
[LeetCode - Daily Challenge] 330. Patching Array
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given a sorted integer array nums and an integer n, add/patch elements to the array such that any number in the range [1, n] inclusive can be formed by the sum of some elements in the array. Return the minimum number of patches required. Example 1: Input: nums = [1,3], n = 6 Output: 1 Explanation: Combinations of nums are [1], [3], [1,3], which form possible ..
Algorithm/LeetCode Daily Challenge
2021. 8. 30. 10:59
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,740
- Today
- 103
- Yesterday
- 133
๋งํฌ
TAG
- Linux
- ์คํ๋ง ๋ถํธ
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- Spring Boot
- Jackson
- ์คํ๋ง๋ถํธ
- JSON
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode
- ์คํ๋ง ๋ถํธ jwt
- gRPC
- r
- leetcode binary search
- spring boot application
- Java
- intellij
- spring boot app
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Data JPA
- JPA
- spring boot jwt
- Spring Boot Tutorial
- leetcode stack
- proto3
- ๋๋ฉ์ธ ์ค๊ณ
- leetcode bst
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ