์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return the linked list sorted as well. Example 1: Input: head = [1,2,3,3,4,4,5] Output: [1,2,5] Example 2: Input: head = [1,1,1,2,3] Output: [2,3] Constraints: The number of nodes in the list is in the range [0, 300]. -10..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a p..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given the heads of two sorted linked lists list1 and list2. Merge the two lists in a one sorted list. The list should be made by splicing together the nodes of the first two lists. Return the head of the merged linked list. Example 1: Input: list1 = [1,2,4], list2 = [1,3,4] Output: [1,1,2,3,4,4] Example 2: Input: list1 = [], list2 = [] Output: [] Exam..
๋ชจ๋ ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์ ํ์ธ ๊ฐ๋ฅํฉ๋๋ค. ๋ฌธ์ ๋งํฌ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -โ. You must write an algorithm that runs in O(log n) time. Example 1: Input: nums = ..
- Total
- 105,550
- Today
- 136
- Yesterday
- 186
- 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