๋ฐ์ํ
[LeetCode - Daily Challenge] 540. Single Element in a Sorted Array
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once. Your solution must run in O(log n) time and O(1) space. Example 1: Input: nums = [1,1,2,3,3,4,4,8,8] Output: 2 Example 2: Input: nums = [3,3,7,7,10,11,11] Outpu..
Algorithm/LeetCode Daily Challenge
2021. 11. 22. 10:30
๋ฐ์ํ
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 105,550
- Today
- 136
- Yesterday
- 186
๋งํฌ
TAG
- r
- ์คํ๋ง๋ถํธ
- ์๊ณ ๋ฆฌ์ฆ
- JSON
- spring boot app
- spring boot jwt
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- Spring Data JPA
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- spring boot application
- Linux
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- Jackson
- ํจ๊ป ์๋ผ๊ธฐ
- ์คํ๋ง ๋ถํธ
- QueryDSL
- @ManyToOne
- Spring Boot Tutorial
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- Spring Boot
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- Java
- leetcode
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- proto3
- intellij
- JPA
- ํด๋ฆฐ ์ํคํ ์ฒ
- gRPC
- Spring Boot JPA