hkl22 블로그

Python AlgorithmLeetCode1. Two SumGiven an array of integers [nums] and an integer target, return indices of the two numbers such that they add up to target.You may assume that each input would have exactly one solution, and you may not use the same element twice.You can return the answer in any order.Constraints2 ≤ nums.length ≤ 10⁴-10⁹ ≤ nums[i] ≤ 10⁹-10⁹ ≤ target ≤ 10⁹Only one valid answer ex..

Python AlgorithmLeetCode704. Binary SearchGiven an array of integers [nums] which is sorted in ascending order, and an integer target, write a function to search target in [nums]. If target exists, then return its index. Otherwise, return -1.You must write an algorithm with O(log n) runtime complexity.Constraints1 ≤ nums.length ≤ 10⁴-10⁴ ⁴All the integers in nums are unique.[nums] is sorted in a..

Python AlgorithmLeetCode49. Group AnagramsGiven an array of strings strs, group the anagrams together. You can return the answer in any order.Constraints1 ≤ strs.length ≤ 10⁴0 ≤ strs[i].length ≤ 100strs[i] consists of lowercase English letters.class Solution: def groupAnagrams(self, strs: List[str]) -> List[List[str]]: # dictionary, key 값을 알파벳들을 정렬한 값으로 사용 d = defaultdict(list) ..

Python AlgorithmLeetCode1184. Distance Between Bus StopsA bus has n stops numbered from 0 to n - 1 that form a circle. We know the distance between all pairs of neighboring stops where distance[i] is the distance between the stops number i and (i + 1) % n.The bus goes along both directions i.e. clockwise and counterclockwise.Return the shortest distance between the given start and destination st..

Python AlgorithmLeetCode2057. Smallest Index With Equal ValueGiven a 0-indexed integer array [nums], return the smallest index i of [nums] such that i mod 10 == nums[i], or -1 if such index does not exist.x mod y denotes the remainder when x is divided by y.Constraints1 ≤ nums.length ≤ 1000 ≤ nums[i] ≤ 9class Solution: def smallestEqual(self, nums: List[int]) -> int: answer = -1 ..

Python AlgorithmLeetCode2600. K Items With the Maximum SumThere is a bag that consists of items, each item has a number 1, 0, or -1 written on it.You are given four non-negative integers numOnes, numZeros, numNegOnes, and k.The bag initially contains:numOnes items with 1s written on them.numZeroes items with 0s written on them.numNegOnes items with -1s written on them.We want to pick exactly k i..

Python AlgorithmLeetCode3285. Find Indices of Stable MountainsThere are n mountains in a row, and each mountain has a height. You are given an integer array [height] where height[i] represents the height of mountain i, and an integer threshold.A mountain is called stable if the mountain just before it (if it exists) has a height strictly greater than threshold. Note that mountain 0 is not stable..

Python AlgorithmLeetCode2639. Find the Width of Columns of a GridYou are given a 0-indexed m x n integer matrix [grid]. The width of a column is the maximum length of its integers.For example, if grid = [[-10], [3], [12]], the width of the only column is 3 since -10 is of length 3.Return an integer array [ans] of size n where ans[i] is the width of the iᵗʰ column.The length of an integer x with ..

Python AlgorithmLeetCode2037. Minimum Number of Moves to Seat EveryoneThere are n availabe seats and n students standing in a room. You are given an array [seats] of length n, where seats[i] is the position of the iᵗʰ seat. You are also given the array [students] of length n, where students[j] is the position of the jᵗʰ student.You may perform the following move any number of times:Increase or d..

3105. Longest Strictly Increasing or Strictly Decreasing SubarrayLeetCodehttps://leetcode.com/problems/longest-strictly-increasing-or-strictly-decreasing-subarray/문제정수 배열 nums가 주어졌습니다.모든 요소가 증가하거나 감소하는 nums의 가장 긴 부분 배열의 길이를 반환하는 코드를 작성하세요.예제Input: nums = [1, 4, 3, 3, 2]Output: 2풀이 과정변수 inc와 dec를 1로 초기화합니다.변수 answer를 1로 초기화합니다.인덱스 i를 사용하여 주어진 배열 nums의 두 번째 요소부터 순회하며 다음 조건을 수행합니다.현재 요소(nums[i])가 이..