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

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/LeetCode (258)
326. Power of Three

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there exists an integer x such that n == 3^x. Example 1: Input: n = 27 Output: true Example 2: Input: n = 0 Output: false Example 3: Input: n = 9 Output: true Solution 3의 n제곱인 경우 true를 반환하는 문제입니다. public class Solution { public boolean isPo..

Algorithm/LeetCode 2022. 8. 27. 10:30
342. Power of Four

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given an integer n, return true if it is a power of four. Otherwise, return false. An integer n is a power of four, if there exists an integer x such that n == 4x. Example 1: Input: n = 16 Output: true Example 2: Input: n = 5 Output: false Example 3: Input: n = 1 Output: true Constraints: -2^31 >= 1; // 오른쪽으로 한 칸 bit shift } return numberOfOnes == 1 && (numbe..

Algorithm/LeetCode 2022. 8. 26. 10:30
234. Palindrome Linked List

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given the head of a singly linked list, return true if it is a palindrome. Example 1: Input: head = [1,2,2,1] Output: true Example 2: Input: head = [1,2] Output: false Constraints: The number of nodes in the list is in the range [1, 10^5]. 0 test(ListNode.of(1, 2, 2, 1), true) ); } private void test(ListNode given, boolean expected) { // when Solution palindr..

Algorithm/LeetCode 2022. 8. 25. 10:30
871. Minimum Number of Refueling Stops

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem A car travels from a starting position to a destination which is target miles east of the starting position. There are gas stations along the way. The gas stations are represented as an array stations where stations[i] = [positioni, fueli] indicates that the ith gas station is positioni miles east of the starting position and has fueli liters of gas. The car ..

Algorithm/LeetCode 2022. 8. 20. 02:00
1338. Reduce Array Size to The Half

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem You are given an integer array arr. You can choose a set of integers and remove all the occurrences of these integers in the array. Return the minimum size of the set so that at least half of the integers of the array are removed. Example 1: Input: arr = [3,3,3,3,5,5,5,2,2,7] Output: 2 Explanation: Choosing {3,7} will make the new array [5,5,5,2,2] which has ..

Algorithm/LeetCode 2022. 8. 19. 10:30
804. Unique Morse Code Words

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem International Morse Code defines a standard encoding where each letter is mapped to a series of dots and dashes, as follows: 'a' maps to ".-", 'b' maps to "-...", 'c' maps to "-.-.", and so on. For convenience, the full table for the 26 letters of the English alphabet is given below: [".-","-...","-.-.","-..",".","..-.","--.","....","..",".---","-.-",".-..","..

Algorithm/LeetCode 2022. 8. 18. 10:30
387. First Unique Character in a String

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a string s, find the first non-repeating character in it and return its index. If it does not exist, return -1. Example 1: Input: s = "leetcode" Output: 0 Example 2: Input: s = "loveleetcode" Output: 2 Example 3: Input: s = "aabb" Output: -1 Constraints: 1 test("loveleetcode", 2), () -> test("aabb", -1) ); } private void test(String given, int expected)..

Algorithm/LeetCode 2022. 8. 17. 10:30
13. Roman to Integer

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 500 M 1000 For example, 2 is written as II in Roman numeral, just two ones added together. 12 is written as XII, which is simply X + II. The number 27 is written as XXVII, which is XX + V + II. Roman numerals are usually written largest to..

Algorithm/LeetCode 2022. 8. 13. 19:50
235. Lowest Common Ancestor of a Binary Search Tree

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and q as the lowest node in T that has both p and q as descendants (where we allow a node to be a descendant of itself).” Example 1: Input: root ..

Algorithm/LeetCode 2022. 8. 12. 22:30
98. Validate Binary Search Tree

소스 코드는 여기 있습니다. 문제는 여기 있습니다. Problem Given the root of a binary tree, determine if it is a valid binary search tree (BST). A valid BST is defined as follows: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search tr..

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

티스토리툴바