์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given two binary search trees root1 and root2, return a list containing all the integers from both trees sorted in ascending order. Example 1: Input: root1 = [2,1,4], root2 = [1,0,3] Output: [0,1,1,2,3,4] Example 2: Input: root1 = [1,null,8], root2 = [8,1] Output: [1,1,8,8] Constraints: The number of nodes in each tree is in the range [0, 5000]. -10^5 test(Tr..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem An integer has sequential digits if and only if each digit in the number is one more than the previous digit. Return a sorted list of all the integers in the range [low, high] inclusive that have sequential digits. Example 1: Input: low = 100, high = 300 Output: [123,234]Example 2: Input: low = 1000, high = 13000 Output: [1234,2345,3456,4567,5678,6789,12345]C..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an array of integers arr, return true if and only if it is a valid mountain array. Recall that arr is a mountain array if and only if: arr.length >= 3 There exists some i with 0 < i < arr.length - 1 such that: arr[0] < arr[1] < ... < arr[i - 1] < arr[i] arr[i] > arr[i + 1] > ... > arr[arr.length - 1] Example 1: Input: arr = [2,1] Output: false Example 2..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem We define the usage of capitals in a word to be right when one of the following cases holds: All letters in this word are capitals, like "USA". All letters in this word are not capitals, like "leetcode". Only the first letter in this word is capital, like "Google". Given a string word, return true if the usage of capitals in it is right. Example 1: Input: wor..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Alice and Bob take turns playing a game, with Alice starting first. Initially, there are n stones in a pile. On each player's turn, that player makes a move consisting of removing any non-zero square number of stones in the pile. Also, if a player cannot make a move, he/she loses the game. Given a positive integer n, return true if and only if Alice wins ..
๋ณธ ํฌ์คํ ์ ๋ฐฑ๊ธฐ์ ๋์ ์คํ๋ง๊ณผ JPA ๊ธฐ๋ฐ ์น ์ ํ๋ฆฌ์ผ์ด์ ๊ฐ๋ฐ ๊ฐ์๋ฅผ ์ฐธ๊ณ ํ์ฌ ์์ฑํ์์ต๋๋ค. ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. (commit hash: 821d983) > git clone https://github.com/lcalmsky/spring-boot-app.git > git checkout 821d983 โน๏ธ squash merge๋ฅผ ์ฌ์ฉํด ๊ธฐ์กด branch๋ฅผ ์ญ์ ํ๊ธฐ๋ก ํ์ฌ ์์ผ๋ก๋ commit hash๋ก ํฌ์คํ ์์ ์ ์์ค ์ฝ๋๋ฅผ ๊ณต์ ํ ์์ ์ ๋๋ค. Overview ํ๋กํ ๋ทฐ๋ฅผ ๊ตฌํํฉ๋๋ค. Description ํ๋กํ์ ๋๊ฐ ๋ณด๋๋์ ๋ฐ๋ผ ๋ฌ๋ผ์ง๊ณ ์ ๋ณด ์ ๋ ฅ ์ ๋ฌด์ ๋ฐ๋ผ ๋ฌ๋ผ์ ธ์ผ ํฉ๋๋ค. ์ธ์ฆ๋ ์ฌ์ฉ์๊ฐ ์๊ธฐ ํ๋กํ ํ๋ฉด์ ์กฐํํ ๋๋ ํธ์ง ๊ฐ๋ฅํด์ผํ๊ณ , ๋ค๋ฅธ ์ฌ๋์ ํ๋กํ์ ์กฐํํ ๋๋ ..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from the ith station to its next (i + 1)th station. You begin the journey with an empty tank at one of the gas stations. Given two integer arrays gas and cost, return the startin..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Koko loves to eat bananas. There are n piles of bananas, the ith pile has piles[i] bananas. The guards have gone and will come back in h hours. Koko can decide her bananas-per-hour eating speed of k. Each hour, she chooses some pile of bananas and eats k bananas from that pile. If the pile has less than k bananas, she eats all of them instead and will not eat..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null. 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 (0-indexed). I..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers..
- Total
- 105,550
- Today
- 136
- Yesterday
- 186
- Spring Data JPA
- ์๊ณ ๋ฆฌ์ฆ
- @ManyToOne
- Linux
- proto3
- leetcode
- JSON
- ํด๋ฆฐ ์ํคํ ์ฒ
- gRPC
- spring boot app
- Spring Boot Tutorial
- Spring Boot JPA
- QueryDSL
- ์คํ๋ง๋ถํธ
- ํจ๊ป ์๋ผ๊ธฐ
- Jackson
- spring boot jwt
- ์คํ๋ง ๋ถํธ
- JPA
- spring boot application
- r
- ํจ๊ป ์๋ผ๊ธฐ ํ๊ธฐ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- intellij
- Spring Boot
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ํฅ์ฌ๊ณ ๋ ์ํคํ ์ฒ
- Java