hyunkookim 님의 블로그

283. Move Zeroes Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.Note that you must do this in-place without making a copy of the array. Example 1:Input: nums = [0,1,0,3,12]Output: [1,3,12,0,0]Example 2:Input: nums = [0]Output: [0] Constraints:1 -2^31  Follow up: Could you minimize the total number of operations done? 문제 풀이..

443. String Compression Given an array of characters chars, compress it using the following algorithm:Begin with an empty string s. For each group of consecutive repeating characters in chars:If the group's length is 1, append the character to s.Otherwise, append the character followed by the group's length.The compressed string s should not be returned separately, but instead, be stored in the ..

334. Increasing Triplet Subsequence Given an integer array nums, return true if there exists a triple of indices (i, j, k) such that i  and nums[i]  false. Example 1:Input: nums = [1,2,3,4,5]Output: trueExplanation: Any triplet where i Example 2:Input: nums = [5,4,3,2,1]Output: falseExplanation: No triplet exists.Example 3:Input: nums = [2,1,5,0,4,6]Output: trueExplanation: The triplet (3, 4, 5)..

345. Reverse Vowels of a String Given a string s, reverse only all the vowels in the string and return it.The vowels are 'a', 'e', 'i', 'o', and 'u', and they can appear in both lower and upper cases, more than once. Example 1:Input: s = "IceCreAm"Output: "AceCreIm"Explanation:The vowels in s are ['I', 'e', 'e', 'A']. On reversing the vowels, s becomes "AceCreIm".Example 2:Input: s = "leetcode"O..

class Solution: def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool: new_flowerbed = [0] + flowerbed + [0] for i in range(1, len(new_flowerbed)-1): # skip first & last if new_flowerbed[i] == 0 and new_flowerbed[i-1] == 0 and new_flowerbed[i+1] == 0: new_flowerbed[i] = 1 n -= 1 #if n == 0: # re..

class Solution: def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]: ans = [] for candy in candies: now = candy + extraCandies b = True for candy2 in candies: if now 1431. Kids With the Greatest Number of Candies There are n kids with candies. You are given an integer array candies, where each candies[i] ..

1071. Greatest Common Divisor of Strings For two strings s and t, we say "t divides s" if and only if s = t + t + t + ... + t + t (i.e., t is concatenated with itself one or more times).Given two strings str1 and str2, return the largest string x such that x divides both str1 and str2. Example 1:Input: str1 = "ABCABC", str2 = "ABC"Output: "ABC"Example 2:Input: str1 = "ABABAB", str2 = "ABAB"Outpu..

1768. Merge Strings Alternately You are given two strings word1 and word2. Merge the strings by adding letters in alternating order, starting with word1. If a string is longer than the other, append the additional letters onto the end of the merged string.Return the merged string. Example 1:Input: word1 = "abc", word2 = "pqr"Output: "apbqcr"Explanation: The merged string will be merged as so:wor..

901. Online Stock Span Design an algorithm that collects daily price quotes for some stock and returns the span of that stock's price for the current day.The span of the stock's price in one day is the maximum number of consecutive days (starting from that day and going backward) for which the stock price was less than or equal to the price of that day.For example, if the prices of the stock in ..

739. Daily Temperatures Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead. Example 1:Input: temperatures = [73,74,75,71,69,72,76,73]Output: [1,1,4,2,1,1,0,0]Examp..