๋ฐ์ํ
128. Longest Consecutive Sequence
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. You must write an algorithm that runs in O(n) time. Example 1: Input: nums = [100,4,200,1,3,2] Output: 4 Explanation: The longest consecutive elements sequence is [1, 2, 3, 4]. Therefore its length is 4. Example 2: Input: nums = [0,3,7,2,5,8,4,6,0,1] Outp..
Algorithm/LeetCode Daily Challenge
2022. 7. 9. 10:30
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 181,998
- Today
- 35
- Yesterday
- 551
๋งํฌ
TAG
- spring boot application
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- Spring Boot
- r
- ์คํ๋ง๋ถํธ
- Linux
- Spring Data JPA
- gRPC
- intellij
- Spring Boot JPA
- spring boot app
- JPA
- proto3
- ํด๋ฆฐ ์ํคํ ์ฒ
- JSON
- ์คํ๋ง ๋ถํธ
- QueryDSL
- Jackson
- spring boot jwt
- @ManyToOne
- leetcode
- ํจ๊ป ์๋ผ๊ธฐ
- ์๊ณ ๋ฆฌ์ฆ
- Java
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- Spring Boot Tutorial