분류 전체보기 (87) 썸네일형 리스트형 [LeetCode] 60. Can Place Flowers You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise. My answer is t.. [LeetCode] 374. Guess Number Higher or Lower 374. Guess Number Higher or Lower We are playing the Guess Game. The game is as follows:I pick a number from 1 to n. You have to guess which number I picked.Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess.You call a pre-defined API int guess(int num), which returns three possible results:-1: Your guess is higher than the number I picked .. [LeetCode] 62. Unique Paths 62. Unique PathsThere is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n - 1]). The robot can only move either down or right at any point in time.Given the two integers m and n, return the number of possible unique paths that the robot can take to reach the bottom-right cor.. Permute Practice def permute(txt, src): if src == len(txt): return ["".join(txt)] seen = set() result = [] for i in range(src, len(txt)): if txt[i] in seen: continue seen.add(txt[i]) if src!=i: txt[src], txt[i] = txt[i], txt[src] result.extend(permute(txt, src+1)) if src!=i: txt[src], txt[i] = txt[i], txt[src] return result result = permute(lits(digits), 0) - Bas.. [LeetCode] 198. House Robber 198. House Robber You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses were broken into on the same night.Given an integer array nums representing th.. [LeetCode] 1137. N-th Tribonacci Number 1137. N-th Tribonacci NumberThe Tribonacci sequence Tn is defined as follows: T0 = 0, T1 = 1, T2 = 1, and Tn+3 = Tn + Tn+1 + Tn+2 for n >= 0.Given n, return the value of Tn. My Codeclass Solution: def tribonacci(self, n: int) -> int: if n Improvedclass Solution: def tribonacci(self, n: int) -> int: if n==0: return 0 elif n==1 or n==2: return 1 .. [LeetCode] 17. Letter Combinations of a Phone Number 17. Letter Combinations of a Phone NumberGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters. BacktrackingBacktracking is an algorithmic techniqe used for solving probl.. [LeetCode] 2390. Removing Stars From a String 2390 . Removing Stars From a String You are given a string s, which contains stars *.In one operation, you can:Choose a star in s.Remove the closest non-star character to its left, as well as remove the star itself.Return the string after all stars have been removed.Note:The input will be generated such that the operation is always possible.It can be shown that the resulting string will always b.. [LeetCode] 338. Counting Bits 435. Counting BitsGiven an integer n, return an array ans of length n +1 such that for each i (0 1. Problem UnderstandingThe problem asks us to count the number of 1s (set bits) in the binary representation of every integer from 0 to n. The result should be returned as an array where the value at index i represents the count of set bits in the binary representation of i. 2. Core Concepts' Bina.. [LeetCode] 435. Non-overlapping Intervals 435. Non-overlapping Intervals Given an array of intervals intervals where intervals[i] = [starti, endi], return the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.Note that intervals which only touch at a point are non-overlapping. For example, [1, 2] and [2, 3] are non-overlapping. 1. 문제 상황주어진 구간에서 겹치는 구간을 최소화하려면 몇 개의 구간을 제거해야 하는지 묻는 문제.겹치지 않는.. 이전 1 2 3 4 ··· 9 다음