Ikjo's Technology blog

문제 설명 문제 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 "". 입출력 예시 Input: strs = ["flower","flow","flight"] Output: "fl" Input: strs = ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. 제한사항 1

문제 설명 문제 Given an integer x, return true if x is palindrome integer. An integer is a palindrome when it reads the same backward as forward. For example, 121 is a palindrome while 123 is not. 입출력 예시 Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Input: x = -121 Output: false Explanation: From left to right, it reads -121. From right to left, i..

문제 설명 문제 Given the head of a sorted linked list, delete all duplicates such that each element appears only once. Return the linked list sorted as well. 입출력 예시 Input: head = [1,1,2] Output: [1,2] Input: head = [1,1,2,3,3] Output: [1,2,3] 제한사항 The number of nodes in the list is in the range [0, 300]. -100

문제 설명 문제 Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1], then return 0. Assume the environment does not allow you to store 64-bit integers (signed or unsigned). 입출력 예시 Input: x = 123 Output: 321 Input: x = -123 Output: -321 Input: x = 120 Output: 21 제한사항 -2^31

문제 설명 Two Sum - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 풀이 : Success 소스 코드 class Solution { public int[] twoSum(int[] nums, int target) { int len = nums.length; for (int i = 0; i < len; i++) { for (int j = i+1; j < len; j++) { if(target == nums[i] + nums[j]) return new int[..