본문 바로가기 메뉴 바로가기

Jaime's 기술 블로그

프로필사진
  • 글쓰기
  • 관리
  • 태그
  • 방명록
  • RSS

Jaime's 기술 블로그

검색하기 폼
  • All (499)
    • IntelliJ IDEA (8)
    • SpringBoot (83)
      • Web Application 만들기 (71)
      • JWT 튜토리얼 (5)
    • Java (19)
    • JPA (33)
    • Querydsl (14)
    • SRE (7)
    • gRPC (10)
    • macOS (7)
    • Docker (1)
    • Linux (5)
    • R (5)
    • Test (3)
    • ETC (13)
    • Algorithm (265)
      • LeetCode (258)
    • Retrospect (4)
    • git (1)
    • Architecture (8)
    • Book (10)
      • 함께 자라기 (7)
      • 프로그래머의 뇌 (3)
    • Essay (1)
  • 방명록

Algorithm (265)
462. Minimum Moves to Equal Array Elements II

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. In one move, you can increment or decrement an element of the array by 1. Test cases are designed so that the answer will fit in a 32-bit integer. Example 1: Input: nums = [1,2,3] Output: 2 Explanation: Only two moves are needed (remember each ..

Algorithm/LeetCode 2022. 7. 2. 10:30
406. Queue Reconstruction by Height

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an array of people, people, which are the attributes of some people in a queue (not necessarily in order). Each people[i] = [hi, ki] represents the ith person of height hi with exactly ki other people in front who have a height greater than or equal to hi. Reconstruct and return the queue that is represented by the input array people. The return..

Algorithm/LeetCode 2022. 7. 1. 10:30
215. Kth Largest Element in an Array

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer array nums and an integer k, return the kth largest element in the array. Note that it is the kth largest element in the sorted order, not the kth distinct element. Example 1: Input: nums = [3,2,1,5,6,4], k = 2 Output: 5 Example 2: Input: nums = [3,2,3,1,2,4,5,5,6], k = 4 Output: 4 Constraints: 1

Algorithm/LeetCode 2022. 6. 24. 10:30
120. Triangle

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an adjacent number of the row below. More formally, if you are on index i on the current row, you may move to either index i or index i + 1 on the next row. Example 1: Input: triangle = [[2],[3,4],[6,5,7],[4,1,8,3]] Output: 11 Explanation: The triangle looks..

Algorithm/LeetCode 2022. 6. 18. 10:30
167. Two Sum II - Input Array Is Sorted

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up to a specific target number. Let these two numbers be numbers[index1] and numbers[index2] where 1

Algorithm/LeetCode 2022. 6. 17. 10:30
1342. Number of Steps to Reduce a Number to Zero

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer num, return the number of steps to reduce it to zero. In one step, if the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it. Example 1: Input: num = 14 Output: 6 Explanation: Step 1) 14 is even; divide by 2 and obtain 7. Step 2) 7 is odd; subtract 1 and obtain 6. Step 3) 6 is even; divide by 2 and o..

Algorithm/LeetCode 2022. 6. 11. 10:30
268. Missing Number

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array. Example 1: Input: nums = [3,0,1] Output: 2 Explanation: n = 3 since there are 3 numbers, so all numbers are in the range [0,3]. 2 is the missing number in the range since it does not appear in nums.Example 2: Input: nums =..

Algorithm/LeetCode 2022. 6. 10. 10:30
1379. Find a Corresponding Node of a Binary Tree in a Clone of That Tree

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given two binary trees original and cloned and given a reference to a node target in the original tree. The cloned tree is a copy of the original tree. Return a reference to the same node in the cloned tree. Note that you are not allowed to change any of the two trees or the target node and the answer must be a reference to a node in the cloned tree. Example ..

Algorithm/LeetCode 2022. 6. 4. 10:30
191. Number of 1 Bits

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). Note: Note that in some languages, such as Java, there is no unsigned integer type. In this case, the input will be given as a signed integer type. It should not affect your implementation, as the integer's internal binary ..

Algorithm/LeetCode 2022. 6. 3. 10:30
47. Permutations II

소스 코드는 여기 있습니다. 문제는 여기 있습니다. 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

Algorithm/LeetCode 2022. 5. 28. 10:30
이전 1 ··· 5 6 7 8 9 10 11 ··· 27 다음
이전 다음
공지사항
최근에 올라온 글
최근에 달린 댓글
Total
Today
Yesterday
링크
  • github
TAG
  • 스프링 부트
  • 스프링 부트 튜토리얼
  • 스프링부트
  • 스프링 데이터 jpa
  • Java
  • spring boot application
  • Linux
  • Spring Boot
  • 스프링 부트 애플리케이션
  • 알고리즘
  • QueryDSL
  • Spring Boot JPA
  • 클린 아키텍처
  • @ManyToOne
  • JPA
  • 함께 자라기 후기
  • 함께 자라기
  • 헥사고날 아키텍처
  • r
  • Spring Boot Tutorial
  • spring boot jwt
  • JSON
  • intellij
  • Spring Data JPA
  • leetcode
  • Jackson
  • 스프링 부트 회원 가입
  • proto3
  • gRPC
  • spring boot app
more
«   2025/08   »
일 월 화 수 목 금 토
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
글 보관함

Blog is powered by Tistory / Designed by Tistory

티스토리툴바