์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an array nums of size n, return the majority element. The majority element is the element that appears more than โn / 2โ times. You may assume that the majority element always exists in the array. Example 1: Input: nums = [3,2,3] Output: 3 Example 2: Input: nums = [2,2,1,1,1,2,2] Output: 2 Constraints: n == nums.length 1
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an array intervals where intervals[i] = [li, ri] represent the interval [li, ri), remove all intervals that are covered by another interval in the list. The interval [a, b) is covered by the interval [c, d) if and only if c
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given an array nums of n positive integers. You can perform two types of operations on any element of the array any number of times: If the element is even, divide it by 2. For example, if the array is [1,2,3,4], then you can do this operation on the last element, and the array will be [1,2,3,2]. If the element is odd, multiply it by 2. For example, i..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space. Example 1: Input: nums = [2,2,1] Output: 1Example 2: Input: nums = [4,1,2,1,2] Output: 4Example 3: Input: nums = [1] Output: 1Constraints: 1
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times. Two combinations are unique if the frequency of at least one of the ..
๋ณธ ํฌ์คํ ์ ๋ฐฑ๊ธฐ์ ๋์ ์คํ๋ง๊ณผ JPA ๊ธฐ๋ฐ ์น ์ ํ๋ฆฌ์ผ์ด์ ๊ฐ๋ฐ ๊ฐ์๋ฅผ ์ฐธ๊ณ ํ์ฌ ์์ฑํ์์ต๋๋ค. ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. (commit hash: 9c46a61) > git clone https://github.com/lcalmsky/spring-boot-app.git > git checkout 9c46a61 โน๏ธ squash merge๋ฅผ ์ฌ์ฉํด ๊ธฐ์กด branch๋ฅผ ์ญ์ ํ๊ธฐ๋ก ํ์ฌ ์์ผ๋ก๋ commit hash๋ก ํฌ์คํ ์์ ์ ์์ค ์ฝ๋๋ฅผ ๊ณต์ ํ ์์ ์ ๋๋ค. Overview ์ง๋ ํฌ์คํ ์์ ๊ตฌํํ ํ๋กํ ์์ ์ ๋ํ ํ ์คํธ ์ฝ๋๋ฅผ ์์ฑํฉ๋๋ค. ๊ธฐ์กด์ ์์ฑํ๋ ํ ์คํธ์๋ ๋ค๋ฅด๊ฒ ์ธ์ฆ๋ ์ฌ์ฉ์๊ฐ ์๋ ์ํ์์ ํ ์คํธ ์ฝ๋๋ฅผ ์์ฑํด์ผ ํฉ๋๋ค. ๋๋ถ๋ถ์ ํ ์คํธ์ ๊ฒฝ์ฐ ์ฌ์ค ์ธ์ฆ๋ ์ฌ์ฉ์์ ๋ํด ์์ฑํด์ผ ํ ..
๋ณธ ํฌ์คํ ์ ๋ฐฑ๊ธฐ์ ๋์ ์คํ๋ง๊ณผ JPA ๊ธฐ๋ฐ ์น ์ ํ๋ฆฌ์ผ์ด์ ๊ฐ๋ฐ ๊ฐ์๋ฅผ ์ฐธ๊ณ ํ์ฌ ์์ฑํ์์ต๋๋ค. ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. (commit hash: 0fa1c18) > git clone https://github.com/lcalmsky/spring-boot-app.git > git checkout 0fa1c18 โน๏ธ squash merge๋ฅผ ์ฌ์ฉํด ๊ธฐ์กด branch๋ฅผ ์ญ์ ํ๊ธฐ๋ก ํ์ฌ ์์ผ๋ก๋ commit hash๋ก ํฌ์คํ ์์ ์ ์์ค ์ฝ๋๋ฅผ ๊ณต์ ํ ์์ ์ ๋๋ค. Overview ํ๋กํ ์์ ๊ธฐ๋ฅ์ ๊ตฌํํฉ๋๋ค. ๊ธฐ์กด ๊ฐ์ฒด ์ ๋ณด๋ฅผ ๋ณ๊ฒฝํ ๋ ์คํ๋ง MVC์ JPA์์ ๊ณ ๋ คํด์ผ ํ ์ฌํญ์ ๋ํด ์์๋ด ๋๋ค. SettingsController ์์ Profile ํผ์ ํตํด ๋ฐ์ ๋ฐ์ดํฐ๋ก ํ๋กํ์ ์์ ํ๊ณ ํ์ด์ง..
๋ณธ ํฌ์คํ ์ ๋ฐฑ๊ธฐ์ ๋์ ์คํ๋ง๊ณผ JPA ๊ธฐ๋ฐ ์น ์ ํ๋ฆฌ์ผ์ด์ ๊ฐ๋ฐ ๊ฐ์๋ฅผ ์ฐธ๊ณ ํ์ฌ ์์ฑํ์์ต๋๋ค. ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. (commit hash: 5dac5a6) > git clone https://github.com/lcalmsky/spring-boot-app.git > git checkout 5dac5a6 โน๏ธ squash merge๋ฅผ ์ฌ์ฉํด ๊ธฐ์กด branch๋ฅผ ์ญ์ ํ๊ธฐ๋ก ํ์ฌ ์์ผ๋ก๋ commit hash๋ก ํฌ์คํ ์์ ์ ์์ค ์ฝ๋๋ฅผ ๊ณต์ ํ ์์ ์ ๋๋ค. Overview ํ๋กํ ์์ ์ ์ํ ๋ทฐ๋ฅผ ๊ตฌํํฉ๋๋ค. ์ปจํธ๋กค๋ฌ ๊ตฌํ ๋จผ์ ํ์ด์ง์ ์ง์ ํ ์ ์๊ฒ ์ปจํธ๋กค๋ฌ๋ฅผ ๊ตฌํํฉ๋๋ค. src/main/java/io/lcalmsky/app/settings/controller/SettingsController..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Example 1: Input: root = [3,9,20,null,null,15,7] Output: 3 Example 2: Input: root = [1,null,2] Output: 2 Constraints: The number of nodes in the tree is in the range [0, 1..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an array of integers nums and an integer k, return the total number of continuous subarrays whose sum equals to k. Example 1: Input: nums = [1,1,1], k = 2 Output: 2 Example 2: Input: nums = [1,2,3], k = 3 Output: 2 Constraints: 1
- Total
- 71,740
- Today
- 103
- Yesterday
- 133
- Linux
- ์คํ๋ง ๋ถํธ
- QueryDSL
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- Spring Boot
- Jackson
- ์คํ๋ง๋ถํธ
- JSON
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- ์๊ณ ๋ฆฌ์ฆ
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- leetcode
- ์คํ๋ง ๋ถํธ jwt
- gRPC
- r
- leetcode binary search
- spring boot application
- Java
- intellij
- spring boot app
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Data JPA
- JPA
- spring boot jwt
- Spring Boot Tutorial
- leetcode stack
- proto3
- ๋๋ฉ์ธ ์ค๊ณ
- leetcode bst
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ