소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array of integers nums containing n + 1 integers where each integer is in the range [1, n] inclusive. There is only one repeated number in nums, return this repeated number. You must solve the problem without modifying the array nums and uses only constant extra space. Example 1: Input: nums = [1,3,4,2,2] Output: 2 Example 2: Input: nums = [3,1,3,4,2..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an m x n binary matrix mat of 1's (representing soldiers) and 0's (representing civilians). The soldiers are positioned in front of the civilians. That is, all the 1's will appear to the left of all the 0's in each row. A row i is weaker than a row j if one of the following is true: The number of soldiers in row i is less than th..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array of integers nums which is sorted in ascending order, and an integer target, write a function to search target in nums. If target exists, then return its index. Otherwise, return -1. You must write an algorithm with O(log n) runtime complexity. Example 1: Input: nums = [-1,0,3,5,9,12], target = 9 Output: 4 Explanation: 9 exists in nums and its i..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem A company is planning to interview 2n people. Given the array costs where costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti, and the cost of flying the ith person to city b is bCosti. Return the minimum cost to fly every person to a city such that exactly n people arrive in each city. Example 1: Input: costs = [[10,20],[30,200..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on. The numeric value of a string consisting of lowercase characters is defined as the sum of its characters' numeric values. For example, the numeric value of t..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given a string s. We want to partition the string into as many parts as possible so that each letter appears in at most one part. Note that the partition is done so that after concatenating all the parts in order, the resultant string should be s. Return a list of integers representing the size of these parts. Example 1: Input: s = "ababcbacadefegdehi..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem In a row of dominoes, tops[i] and bottoms[i] represent the top and bottom halves of the ith domino. (A domino is a tile with two numbers from 1 to 6 - one on each half of the tile.) We may rotate the ith domino, so that tops[i] and bottoms[i] swap values. Return the minimum number of rotations so that all the values in tops are the same, or all the values in ..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem We stack glasses in a pyramid, where the first row has 1 glass, the second row has 2 glasses, and so on until the 100th row. Each glass holds one cup of champagne. Then, some champagne is poured into the first glass at the top. When the topmost glass is full, any excess liquid poured will fall equally to the glass immediately to the left and right of it. When..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given two integer arrays pushed and popped each with distinct values, return true if this could have been the result of a sequence of push and pop operations on an initially empty stack, or false otherwise. Example 1: Input: pushed = [1,2,3,4,5], popped = [4,5,3,2,1] Output: true Explanation: We might do the following sequence: push(1), push(2), push(3), push..
소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string path, which is an absolute path (starting with a slash '/') to a file or directory in a Unix-style file system, convert it to the simplified canonical path. In a Unix-style file system, a period '.' refers to the current directory, a double period '..' refers to the directory up a level, and any multiple consecutive slas..
- Total
- Today
- Yesterday
- spring boot app
- Spring Boot JPA
- spring boot application
- JPA
- 클린 아키텍처
- spring boot jwt
- proto3
- Jackson
- Linux
- 알고리즘
- 스프링 부트 튜토리얼
- Spring Data JPA
- 함께 자라기
- 헥사고날 아키텍처
- 함께 자라기 후기
- 스프링 부트 애플리케이션
- 스프링 데이터 jpa
- intellij
- 스프링부트
- r
- Spring Boot Tutorial
- JSON
- Spring Boot
- 스프링 부트 회원 가입
- Java
- QueryDSL
- @ManyToOne
- leetcode
- gRPC
- 스프링 부트
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |