divide-array-in-sets-of-k-consecutive-numbers

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an array of integers <code>nums</code> and a positive integer <code>k</code>, check whether it is possible to divide this array into sets of <code>k</code> consecutive numbers.

Return <code>true</code> if it is possible. Otherwise, return <code>false</code>.

&nbsp;
Example 1:

<pre>
Input: nums = [1,2,3,3,4,4,5,6], k = 4
Output: true
Explanation: Array can be divided into [1,2,3,4] and [3,4,5,6].
</pre>

Example 2:

<pre>
Input: nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
Output: true
Explanation: Array can be divided into [1,2,3] , [2,3,4] , [3,4,5] and [9,10,11].
</pre>

Example 3:

<pre>
Input: nums = [1,2,3,4], k = 3
Output: false
Explanation: Each array should be divided in subarrays of size 3.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
</ul>

&nbsp;
Note: This question is the same as&nbsp;846:&nbsp;<a href="https://leetcode.com/problems/hand-of-straights/" target="_blank">https://leetcode.com/problems/hand-of-straights/</a>

isPossibleDivide

Divide Array in Sets of K Consecutive Numbers

Split Array into Consecutive Subsequences

split-array-into-consecutive-subsequences

分割数组为连续子序列

All Divisions With the Highest Score of a Binary Array

all-divisions-with-the-highest-score-of-a-binary-array

分组得分最高的所有下标

Greedy

Array

Hash Table

Sorting

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个正整数&nbsp;<code>k</code>，请你判断是否可以把这个数组划分成一些由&nbsp;<code>k</code>&nbsp;个连续数字组成的集合。 
如果可以，请返回 <code>true</code>；否则，返回 <code>false</code>。

&nbsp;

示例 1：

<pre>
输入：nums = [1,2,3,3,4,4,5,6], k = 4
输出：true
解释：数组可以分成 [1,2,3,4] 和 [3,4,5,6]。
</pre>

示例 2：

<pre>
输入：nums = [3,2,1,2,3,4,3,4,5,9,10,11], k = 3
输出：true
解释：数组可以分成 [1,2,3] , [2,3,4] , [3,4,5] 和 [9,10,11]。
</pre>

示例 4：

<pre>
输入：nums = [1,2,3,4], k = 3
输出：false
解释：数组不能分成几个大小为 3 的子数组。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= k &lt;= nums.length &lt;= 105</code></li>
	<li><code>1 &lt;= nums[i] &lt;= 109</code></li>
</ul>

&nbsp;

注意：此题目与 846 重复：<a href="https://leetcode-cn.com/problems/hand-of-straights/" target="_blank">https://leetcode-cn.com/problems/hand-of-straights/</a>