shuuji3.xyz
[READ-ONLY] Mirror of https://github.com/shuuji3/leetcode. 馃搩 Code submitted to LeetCode
leetcode.com/shuuji3/
leetcode
leetcode-solutions
548 B
16 lines
1class Solution:
2 def isPossibleDivide(self, nums: List[int], k: int) -> bool:
3 # In case of non multiple
4 if len(nums) % k != 0:
5 return False
6
7 sorted_nums = sorted(nums)
8 for _ in range(len(nums) // k):
9 first_num = sorted_nums[0]
10 for i in range(k):
11 target_num = first_num + i
12 if target_num in sorted_nums:
13 sorted_nums.pop(sorted_nums.index(target_num))
14 else:
15 return False
16 return True