92. Reverse Linked List II
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the head of a singly linked list and two integers left and right where left test(ListNode.of(1, 2, 3, 4, 5), 2, 4, ListNode.of(1, 4, 3, 2, 5)), () -> test(ListNode.of(3, 5), 1, 1, ListNode.of(3, 5)) ); } private void test(ListNode given, int m, int n, ListNode expected) { // when Solution reverseLinkedList2 = new Solution(); ListNode actual = reverseLin..
Algorithm/LeetCode Daily Challenge
2022. 7. 22. 10:30
๊ณต์ง์ฌํญ
์ต๊ทผ์ ์ฌ๋ผ์จ ๊ธ
์ต๊ทผ์ ๋ฌ๋ฆฐ ๋๊ธ
- Total
- 202,075
- Today
- 1
- Yesterday
- 511
๋งํฌ
TAG
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- ์๊ณ ๋ฆฌ์ฆ
- Spring Boot Tutorial
- proto3
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- spring boot application
- QueryDSL
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- JPA
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- leetcode
- ํจ๊ป ์๋ผ๊ธฐ
- spring boot app
- JSON
- Jackson
- ์คํ๋ง๋ถํธ
- Spring Boot JPA
- @ManyToOne
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ
- gRPC
- Spring Data JPA
- ํด๋ฆฐ ์ํคํ ์ฒ
- spring boot jwt
- Linux
- Java
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- Spring Boot
- intellij
- r