์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given a collection of numbers, nums, that might contain duplicates, return all possible unique permutations in any order. Example 1: Input: nums = [1,1,2] Output: [[1,1,2], [1,2,1], [2,1,1]]Example 2: Input: nums = [1,2,3] Output: [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]Constraints: 1
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given the root of a binary tree, return the sum of values of its deepest leaves. Example 1: Input: root = [1,2,3,4,5,null,6,7,null,null,null,null,8] Output: 15Example 2: Input: root = [6,7,8,2,7,1,3,9,null,1,4,null,null,null,5] Output: 19Constraints: The number of nodes in the tree is in the range [1, 10^4]. 1 test(TreeNode.of(6, 7, 8, 2, 7, 1, 3, 9, null, 1,..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cell, you can either move in four directions: left, right, up, or down. You may not move diagonally or move outside the boundary (i.e., wrap-around is not allowed). Example 1: Input: matrix = [[9,9,4],[6,6,8],[2,1,1]] Output: 4 Explanation: The longest increa..
๋ณธ ํฌ์คํ ์ ๋ฐฑ๊ธฐ์ ๋์ ์คํ๋ง๊ณผ JPA ๊ธฐ๋ฐ ์น ์ ํ๋ฆฌ์ผ์ด์ ๊ฐ๋ฐ ๊ฐ์๋ฅผ ์ฐธ๊ณ ํ์ฌ ์์ฑํ์์ต๋๋ค. ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. (commit hash: 020e464) > git clone https://github.com/lcalmsky/spring-boot-app.git > git checkout 020e464 โน๏ธ squash merge๋ฅผ ์ฌ์ฉํด ๊ธฐ์กด branch๋ฅผ ์ญ์ ํ๊ธฐ๋ก ํ์ฌ ์์ผ๋ก๋ commit hash๋ก ํฌ์คํ ์์ ์ ์์ค ์ฝ๋๋ฅผ ๊ณต์ ํ ์์ ์ ๋๋ค. Overview ๋ชจ์ ์ญ์ ๊ธฐ๋ฅ์ ๊ตฌํํฉ๋๋ค. ์๋ํฌ์ธํธ ์ถ๊ฐ ๋ชจ์ ์ทจ์ ๋ฒํผ์ ๋งคํ๋๋ ์๋ํฌ์ธํธ๋ฅผ EventController์ ์ถ๊ฐํฉ๋๋ค. /src/main/java/io/lcalmsky/app/event/endpoint/EventCont..
GitHub markdown์์ ์ํ ํํ์ ๋ ๋๋ง์ ์ ๊ณตํฉ๋๋ค. (2022๋ 5์ 19์ผ๋ถํฐ!) LaTeX ๋ฌธ๋ฒ์ผ๋ก inline ๋๋ code block ํํ๋ก ์์ฑํ ์ ์์ต๋๋ค. block์ผ๋ก ์ฌ์ฉ ์ฃผ๋ณ ํ ์คํธ์ ๋ณ๊ฐ๋ก ์ํ ํํ์์ ์ถ๊ฐํ๊ธฐ ์ํด ์ฌ์ฉํฉ๋๋ค. $$๋ก ์๋ก์ด ๋ผ์ธ์ ์์ํ๋ฉด ์ํ ํํ์์ผ๋ก ์ธ์ํฉ๋๋ค. ์๋ ์ฒ๋ผ ์ ๋ ฅํ์ ๊ฒฝ์ฐ, **The Cauchy-Schwarz Inequality** $$\left( \sum_{k=1}^n a_k b_k \right)^2 \leq \left( \sum_{k=1}^n a_k^2 \right) \left( \sum_{k=1}^n b_k^2 \right)$$ ์ด๋ ๊ฒ ํ์๋ฉ๋๋ค. inline์ผ๋ก ์ฌ์ฉ ํ ์คํธ ์ค๊ฐ์ ์ํ์์ ์ ๋ ฅํด์ผ ํ ๊ฒฝ์ฐ $๋ฅผ ์ฌ์ฉํฉ..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an n x n binary matrix grid, return the length of the shortest clear path in the matrix. If there is no clear path, return -1. A clear path in a binary matrix is a path from the top-left cell (i.e., (0, 0)) to the bottom-right cell (i.e., (n - 1, n - 1)) such that: All the visited cells of the path are 0. All the adjacent cells of the path are 8-directi..
๋ณธ ํฌ์คํ ์ ๋ฐฑ๊ธฐ์ ๋์ ์คํ๋ง๊ณผ JPA ๊ธฐ๋ฐ ์น ์ ํ๋ฆฌ์ผ์ด์ ๊ฐ๋ฐ ๊ฐ์๋ฅผ ์ฐธ๊ณ ํ์ฌ ์์ฑํ์์ต๋๋ค. ์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. (commit hash: 0f966b5) > git clone https://github.com/lcalmsky/spring-boot-app.git > git checkout 0f966b5 โน๏ธ squash merge๋ฅผ ์ฌ์ฉํด ๊ธฐ์กด branch๋ฅผ ์ญ์ ํ๊ธฐ๋ก ํ์ฌ ์์ผ๋ก๋ commit hash๋ก ํฌ์คํ ์์ ์ ์์ค ์ฝ๋๋ฅผ ๊ณต์ ํ ์์ ์ ๋๋ค. Overview ๋ชจ์ ์์ ๊ธฐ๋ฅ์ ๊ตฌํํฉ๋๋ค. ๋ชจ์ง ์์ ๊ธฐ๋ฅ ์ค ์ ์ฝ์ ๋์ด์ผ ํ ๊ฒ๋ค์ด ์์ต๋๋ค. ์ ์ฐฉ์๊ณผ ๊ด๋ฆฌ์ ์น์ธ ๋ ๊ฐ์ง์ ์ฑ๊ฒฉ์ด ๋๋ฌด ๋ค๋ฅด๊ธฐ ๋๋ฌธ์ ๋ชจ์ง ๋ฐฉ๋ฒ์ ์์ ํ ์ ์์ต๋๋ค. ๊ทธ๋ฆฌ๊ณ ๋ชจ์ง ์ธ์์ ํ์ ๋ ์ฐธ๊ฐ ์ ์ฒญ ์ ๋ณด๋ค๋ ..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given a network of n nodes, labeled from 1 to n. You are also given times, a list of travel times as directed edges times[i] = (ui, vi, wi), where ui is the source node, vi is the target node, and wi is the time it takes for a signal to travel from source to target. We will send a signal from a given node k. Return the time it takes for all the n node..
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfies this condition. Example 1: Input: nums = [3,1,2,4] Output: [2,4,3,1] Explanation: The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted.Example 2: Input: nums = [0] Output: [0]Constraints: 1
์์ค ์ฝ๋๋ ์ฌ๊ธฐ ์์ต๋๋ค. ๋ฌธ์ ๋ ์ฌ๊ธฐ ์์ต๋๋ค. Problem You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together. We repeatedly make k duplicate removals on s until we no longer can. Return the final string after all such duplicate removals have be..
- Total
- 71,526
- Today
- 22
- Yesterday
- 397
- r
- spring boot jwt
- JPA
- gRPC
- ๋๋ฉ์ธ ์ค๊ณ
- ์๊ณ ๋ฆฌ์ฆ
- leetcode
- QueryDSL
- ์คํ๋ง ๋ถํธ ์น ์ ํ๋ฆฌ์ผ์ด์
- Spring Boot
- ์คํ๋ง๋ถํธ
- intellij
- ์คํ๋ง ๋ฐ์ดํฐ jpa
- ์คํ๋ง ๋ถํธ ์ ํ๋ฆฌ์ผ์ด์
- leetcode bst
- Java
- Jackson
- ์คํ๋ง ๋ถํธ jwt
- leetcode binary search
- leetcode stack
- spring boot application
- ์คํ๋ง ๋ถํธ ํ์ ๊ฐ์
- proto3
- Linux
- ์คํ๋ง ๋ถํธ
- ์คํ๋ง ๋ถํธ ํํ ๋ฆฌ์ผ
- Spring Data JPA
- spring boot app
- Spring Boot Tutorial
- JSON