leetcode 659. Split Array into Consecutive Subsequences

原题：

You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subsequences consist of at least 3 consecutive integers. Return whether you can make such a split.

Example 1:

Input: [1,2,3,3,4,5]
Output: True
Explanation:
You can split them into two consecutive subsequences :
1, 2, 3
3, 4, 5

Example 2:

Input: [1,2,3,3,4,4,5,5]
Output: True
Explanation:
You can split them into two consecutive subsequences :
1, 2, 3, 4, 5
3, 4, 5

Example 3:

Input: [1,2,3,4,4,5]
Output: False

Note:

The length of the input is in range of [1, 10000]

写个这个玩意还真是费尽。。。

代码如下：

bool isPossible(int* nums, int numsSize) {if(numsSize<3)return false;struct listnode{int lastnum;int count;};struct listnode* test;test=(struct listnode*)malloc(sizeof(struct listnode)*20000);int amount=0;for(int n=0;n<numsSize;n++){int flag=1;for(int m=amount-1;m>=0;m--){if((test+m)->lastnum==(*(nums+n)-1)){flag=0;(test+m)->lastnum+=1;(test+m)->count+=1;break;}}if(flag==1){(test+amount)->lastnum=*(nums+n);(test+amount)->count=1;amount++;}}for(int n=0;n<amount;n++){//printf("F%d",(test+n)->count);if((test+n)->count<3)return false;}return true;
}

就是构建几个桶一样，往里面扔数字，规则就是从后往前（时间顺序）。

最后检索有没有桶不够三个。

得出结论。

leetcode 659. Split Array into Consecutive Subsequences相关推荐

LeetCode 659 Split Array into Consecutive Subsequences
LeetCode Brute Force的方法就是把维护这些字串,每次来新的就加入到符合条件的但是最短的字串中去. 因为不需要求这些字串,可以做一些优化,用字串最后一位数作为key,把长度存入一个di ...
LeetCode 410. Split Array Largest Sum
方法一:DFS+Memoization 某种程度来说本题和 Word Break 很像.直接dfs暴力做肯定会超时,加上memoization即可. dfs(start, m, ...) 表示从ind ...
leetcode 330. Patching Array | 1798. Maximum Number of Consecutive Values You Can Make
1798. Maximum Number of Consecutive Values You Can Make | 1798. 你能构造出连续值的最大数目 https://leetcode.com/p ...
LeetCode 905 Sort Array By Parity--Java stream，Python lambda表达式一行解法
题目地址:Sort Array By Parity - LeetCode Given an array A of non-negative integers, return an array cons ...
LeetCode 659. 分割数组为连续子序列
LeetCode 659. 分割数组为连续子序列回顾根据题意,每个元素只会涉及两种情况: 已经存在nums[i]-1结尾的序列,我们把nums[i]接到之前的某个序列后. 尝试以nums[i]为头 ...
[勇者闯LeetCode] 189. Rotate Array
[勇者闯LeetCode] 189. Rotate Array Description Rotate an array of n elements to the right by k steps. F ...
leetcode 485,487,1004. Max Consecutive Ones I ,II, III（最大连续1的个数问题合集）
485. Max Consecutive Ones https://leetcode.com/problems/max-consecutive-ones/ easy 题,思路不说了,直接上代码. cl ...
【LeetCode】954. Array of Doubled Pairs 解题报告（Python）
作者: 负雪明烛 id: fuxuemingzhu 个人博客: http://fuxuemingzhu.cn/ 目录题目描述题目大意解题方法日期题目地址:https://leetcode.c ...
[Leetcode] Merge Sorted Array 合并数组
Merge Sorted Array 最新更新请见:https://yanjia.me/zh/2019/02/... Given two sorted integer arrays nums1 and ...

leetcode 659. Split Array into Consecutive Subsequences

leetcode 659. Split Array into Consecutive Subsequences相关推荐

最新文章

热门文章