Ikjo's Technology blog

문제 설명 Number of Times Binary String Is Prefix-Aligned - 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 접근 방법 나의 접근 방법 flips 배열 크기의 boolean형 배열을 생성 후 flips 값 순서대로 해당 배열의 인덱스에 true를 할당해주었습니다. 이후 배열의 인덱스가 1부터 현재 단계의 수(n'th step)까지 모두 true일 경우 결과값에 1을 더해주도록 했습니다. 하지만, 이 경우 flips 값과 상관..

문제 설명 Longest Substring Without Repeating Characters - 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 lengthOfLongestSubstring(String s) { if (s.length() == 0) return 0; else if (s.length() == 1) return 1; int result = 0; String temp ..

문제 설명 문제 Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle in a linked list if there is some node in the list that can be reached again by continuously following the next pointer. Internally, pos is used to denote the index of the node that tail's next pointer is connected to. Note that pos is not passed as a parameter. Return true if there i..

문제 설명 문제 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..