[LeetCode] 665. Non-decreasing Array
Python class Solution: def checkPossibility(self, nums: List[int]) -> bool: count = 0 for i in range(1, len(nums)): if num...
최근 포스트
[LeetCode] 859. Buddy Strings
Python class Solution: def buddyStrings(self, s: str, goal: str) -> bool: count = 0 if len(s) != len(goal) or sorted(s) != sorted(goal...
[LeetCode] 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers
Python class Solution: def minPartitions(self, n: str) -> int: return max(n)
[LeetCode] 1431. Kids With the Greatest Number of Candies
Python class Solution: def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]: temp = max(candies) answer = []...
[LeetCode] 1512. Number of Good Pairs
Python class Solution: def numIdenticalPairs(self, nums: List[int]) -> int: answer = 0 for i in range(len(nums)): for j in...