leetcode 659. Split Array into Consecutive Subsequences
来源:互联网 发布:针锋对决网络剧爱奇艺 编辑:程序博客网 时间:2024/05/17 22:15
原题:
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: TrueExplanation:You can split them into two consecutive subsequences : 1, 2, 33, 4, 5
Example 2:
Input: [1,2,3,3,4,4,5,5]Output: TrueExplanation:You can split them into two consecutive subsequences : 1, 2, 3, 4, 53, 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;}
就是构建几个桶一样,往里面扔数字,规则就是从后往前(时间顺序)。
最后检索有没有桶不够三个。
得出结论。
阅读全文
0 0
- leetcode 659. Split Array into Consecutive Subsequences
- leetcode 659. Split Array into Consecutive Subsequences
- LeetCode #659 Split Array into Consecutive Subsequences
- leetcode 659. Split Array into Consecutive Subsequences 分割连续序列
- 659. Split Array into Consecutive Subsequences
- 659. Split Array into Consecutive Subsequences
- 659. Split Array into Consecutive Subsequences
- Split Array into Consecutive Subsequences
- LeetCode[659]Split Array into Consecutive Subsequences(Java)
- 659. Split Array into Consecutive Subsequences 堆、优先级队列、哈希表
- Split Array into Consecutive Subsequences 解法
- Leetcode 649, Split Array to Consecutive Subsequences
- Leetcode659——Split Array into Consecutive Subsequences
- Split Array into Consecutive Subsequences问题及解法
- [LeetCode] 贪心算法之 Split Array into Consecutive Subsequence
- 算法作业系列9——Split Array into Consecutive Subsequences
- bash split string into array
- Array into ranges of consecutive numbers
- no tests found matching[{ExactMatcher:fDisplayName=testSave}]
- Redis设实
- 健身计划(二分答案)
- 百度之星 1006 小小粉丝度度熊
- TensorFlow的安装
- leetcode 659. Split Array into Consecutive Subsequences
- Http Response的一些理解
- 行内元素与块级元素区别
- 媒体查询
- String、StringBuffer、StringBuilder的区别?
- 写了一个类似QQ的item侧滑效果,以待后用
- PHP实现定时任务(非linux-shell方式,与操作系统无关)
- 阿里JAVA开发面试常问问题总结4
- matplotlib模块数据可视化-设置图例