Simulation volume leetcode [general] 1296 Divide an array into a set of consecutive numbers

1296. Divide an array into a set of consecutive numbers

Give you an array of integers  nums  And a positive integer  k, Please judge whether this array can be divided into some by  k  A set of consecutive numbers .
If possible , Please return true; otherwise , return false.

Example 1：

Input ：nums = [1,2,3,3,4,4,5,6], k = 4
Output ：true
explain ： The array can be divided into [1,2,3,4] and [3,4,5,6].
Example 2：

Input ：nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
Output ：true
explain ： The array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
Example 3：

Input ：nums = [3,3,2,2,1,1], k = 3
Output ：true
Example 4：

Input ：nums = [1,2,3,4], k = 3
Output ：false
explain ： The array cannot be divided into several sizes 3 Subarray .

Tips ：

1 <= k <= nums.length <= 105
1 <= nums[i] <= 109

Be careful ： This topic is related to 846 repeat ：https://leetcode-cn.com/problems/hand-of-straights/

source ： Power button （LeetCode）
link ：https://leetcode-cn.com/problems/divide-array-in-sets-of-k-consecutive-numbers
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

Code ：

from leetcode_python.utils import *


class Solution:
    def __init__(self):
        pass

    def isPossibleDivide(self, nums: List[int], k: int) -> bool:
        if len(nums)%k>0:return False
        cnt = Counter(nums)
        while cnt:
            x = min(cnt)
            for n in range(x,x+k):
                if cnt[n]==1:cnt.pop(n)
                elif cnt[n]>1:cnt[n]-=1
                else:return False
        return True


def test(data_test):
    s = Solution()
    data = data_test  # normal
    # data = [list2node(data_test[0])] # list turn node
    return s.getResult(*data)


def test_obj(data_test):
    result = [None]
    obj = Solution(*data_test[1][0])
    for fun, data in zip(data_test[0][1::], data_test[1][1::]):
        if data:
            res = obj.__getattribute__(fun)(*data)
        else:
            res = obj.__getattribute__(fun)()
        result.append(res)
    return result


if __name__ == '__main__':
    datas = [
        [],
    ]
    for data_test in datas:
        t0 = time.time()
        print('-' * 50)
        print('input:', data_test)
        print('output:', test(data_test))
        print(f'use time:{
      time.time() - t0}s')

remarks ：
GitHub：https://github.com/monijuan/leetcode_python

CSDN Summary ： Simulation volume Leetcode Summary of questions _ Paper blog -CSDN Blog

You can add QQ Group communication ：1092754609

leetcode_python.utils See the description on the summary page for details
First brush questions , Then generated by script blog, If there is any mistake, please leave a message , I see it will be revised ！ thank you ！