Leetcode 649, Split Array to Consecutive Subsequences
来源:互联网 发布:美国非农数据公布网站 编辑:程序博客网 时间:2024/04/30 23:15
leetcode 649
返回是否能把一个升序的数组分成若干个最小长度为3的连续数字串。听起来有点像蜘蛛纸牌一样的东西。解决办法就是把数组从头到尾扫一遍,每读入一个数字i,如果有以i-1结束的串就把这个数字加到这些串里最短的串的的后面,然后将以i-1结尾的串更改为以i结尾的串,没有就放到一个空串里面,最后检查这些串里面有没有长度小于3的。
不需要具体的记录每一个串,只需要记录每一个以i结尾的串的长度就可以了。
以下是代码:
class Solution {public: bool isPossible(vector<int>& nums) { unordered_map<int, priority_queue<int, vector<int>, greater<int>>> backs; int flag = 0; for (auto i : nums) { if(!backs[i - 1].empty()) { int count = backs[i - 1].top(); backs[i - 1].pop(); backs[i].push(++count); if(count == 3) flag--; } else { backs[i].push(1); flag++; } } return flag == 0; }};
阅读全文
0 0
- Leetcode 649, Split Array to Consecutive Subsequences
- leetcode 659. Split Array into Consecutive Subsequences
- LeetCode #659 Split Array into Consecutive Subsequences
- leetcode 659. Split Array into Consecutive Subsequences
- Split Array into Consecutive Subsequences
- LeetCode[659]Split Array into Consecutive Subsequences(Java)
- leetcode 659. Split Array into Consecutive Subsequences 分割连续序列
- 659. Split Array into Consecutive Subsequences
- 659. Split Array into Consecutive Subsequences
- Split Array into Consecutive Subsequences 解法
- 659. Split Array into Consecutive Subsequences
- Leetcode659——Split Array into Consecutive Subsequences
- 659. Split Array into Consecutive Subsequences 堆、优先级队列、哈希表
- Split Array into Consecutive Subsequences问题及解法
- 算法作业系列9——Split Array into Consecutive Subsequences
- [LeetCode] 贪心算法之 Split Array into Consecutive Subsequence
- [leetcode][array] Longest Consecutive Sequence
- LeetCode: Split Array Largest Sum
- 环境变量PATH,cp命令,mv命令
- spring-cloud-config + spring-cloud-bus实现动态刷新集群配置
- 数据结构学习记录-二叉树的遍历
- 题目“输入数字星期,输出英文”——代码调试有误
- n个数的最小公倍数
- Leetcode 649, Split Array to Consecutive Subsequences
- jquery操作checkbox
- 安装boost遇到问题,libboost_iostreams.a总是编译不出来
- 解决android studio引用远程仓库下载慢(JCenter下载慢)
- 【noip 1999】旅行家的预算
- 已成功连接到库却undefined reference to 错误
- javascript之AJAX(二)json
- C和指针之删除字符串第一次出现的子串
- strlen /sizeof/ 0,'\0','0'中的陷阱+补充字符串字符数与数组大小相等