728x90
๋ฐ์ํ
[LeetCode - Daily Challenge] 55. Jump Game
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last index, or false otherwise. Example 1: Input: nums = [2,3,1,1,4] Output: true Explanation: Jump 1 step from index 0 to 1, then 3 steps to the ..
Algorithm/LeetCode Daily Challenge
2021. 10. 4. 09:43
728x90
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 71,526
- Today
- 22
- Yesterday
- 397
๋งํฌ
TAG
- r
- spring boot jwt
- JPA
- gRPC
- ๋๋ฉ์ธ ์ค๊ณ
- ์๊ณ ๋ฆฌ์ฆ
- leetcode
- QueryDSL
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Boot
- ์คํ๋ง๋ถํธ
- intellij
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- leetcode bst
- Java
- Jackson
- ์คํ๋ง ๋ถํธ jwt
- leetcode binary search
- leetcode stack
- spring boot application
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- Linux
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- Spring Data JPA
- spring boot app
- Spring Boot Tutorial
- JSON