굉장히 개인적인 저장소

굉장히 개인적인 저장소

  • 분류 전체보기 (18)
    • 문제해결 (1)
    • Program (1)
      • Java (1)
      • JavaScript (0)
      • Thymeleaf (0)
    • OS (1)
      • Linux (1)
    • 알고리즘 (15)
      • LeetCode (15)
    • 커리어 (0)
    • 토이 프로젝트 (0)
      • Project A (0)
    로그인
    로그아웃 글쓰기 관리

    굉장히 개인적인 저장소

    컨텐츠 검색

    태그

    #프로그래밍 첫걸음 시작하기 내일배움카드 JavaScript AJAX Cors 패스트캠퍼스 K-디지털크레딧 java Linux 프로그래밍 기초 LeetCode 바이트디그리 Proxy

    최근글

    댓글

    공지사항

    아카이브

    알고리즘(15)

    • [LeetCode] 16. 3Sum Closest (Java)

      Description Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target. Return the sum of the three integers. You may assume that each input would have exactly one solution. target과 가장 가까운 세 정수의 합을 구하기. Example 1: Input: nums = [-1,2,1,-4], target = 1 Output: 2 Explanation: The sum that is closest to the target is 2. (-1 + 2 ..

      2023.01.11
    • [LeetCode] 14. Longest Common Prefix (Java)

      Description Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string "". 가장 긴 접두 문자를 구하기. Example 1: Input: strs = ["flower","flow","flight"] Output: "fl" Example 2: Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Constraints: 1

      2023.01.09
    • [LeetCode] 13. Roman to Integer (Java)

      Description 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 smallest from left to ri..

      2023.01.09
    • [LeetCode] 12. Integer to Roman (Java)

      Description 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 one's 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 smallest from left to r..

      2023.01.05
    • [LeetCode] 11. Container With Most Water (Java)

      Description You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Find two lines that together with the x-axis form a container, such that the container contains the most water. Return the maximum amount of water a container can store. Notice that you may not slant the container. 주어진 정수의 배열을 ..

      2023.01.04
    • [LeetCode] 9. Palindrome Number (Java)

      Description Given an integer x, return true if x is a palindrome, and false otherwise. 주어진 정수 x가 거꾸로 읽어도 같다면 true 아니면 false를 반환하기. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Example 2: Input: x = -121 Output: false Explanation: From left to right, it reads -121. From right to left, it becomes 121-. Therefore it is not a palindr..

      2023.01.04
    이전
    1 2 3
    다음
    © 2018 TISTORY. All rights reserved.

    티스토리툴바