[Leetcode] 444. Sequence Reconstruction 解题报告
来源:互联网 发布:中国汽车工业工程 知乎 编辑:程序博客网 时间:2024/06/03 22:43
题目:
Check whether the original sequence org
can be uniquely reconstructed from the sequences in seqs
. The org
sequence is a permutation of the integers from 1 to n, with 1 ≤ n ≤ 104. Reconstruction means building a shortest common supersequence of the sequences in seqs
(i.e., a shortest sequence so that all sequences in seqs
are subsequences of it). Determine whether there is only one sequence that can be reconstructed from seqs
and it is the org
sequence.
Example 1:
Input:org: [1,2,3], seqs: [[1,2],[1,3]]Output:falseExplanation:[1,2,3] is not the only one sequence that can be reconstructed, because [1,3,2] is also a valid sequence that can be reconstructed.
Example 2:
Input:org: [1,2,3], seqs: [[1,2]]Output:falseExplanation:The reconstructed sequence can only be [1,2].
Example 3:
Input:org: [1,2,3], seqs: [[1,2],[1,3],[2,3]]Output:trueExplanation:The sequences [1,2], [1,3], and [2,3] can uniquely reconstruct the original sequence [1,2,3].
Example 4:
Input:org: [4,1,5,2,6,3], seqs: [[5,2,6,3],[4,1,5,2]]Output:true
UPDATE (2017/1/8):
The seqs parameter had been changed to a list of list of strings (instead of a 2d array of strings). Please reload the code definition to get the latest changes.
思路:
一道比较麻烦的拓扑排序题目。
代码:
class Solution {public: bool sequenceReconstruction(vector<int>& org, vector<vector<int>>& seqs) { if (seqs.size() == 0) { return false; } int n = org.size(); int count = 0; unordered_map<int, unordered_set<int>> graph; // record parents vector<int> degree(n + 1, 0); // record out degree for (auto s : seqs) { for (int i = s.size() - 1; i >= 0; --i) { if (s[i] > n || s[i] < 0) { return false; // in case number in seqs is out of range 1-n } if (i > 0 && !graph[s[i]].count(s[i-1])) { // if not included graph[s[i]].insert(s[i-1]); if (degree[s[i-1]]++ == 0) count++; } } } if (count < n - 1) { return false; // all nodes should have degree larger than 0 except the last one } for (int i = n-1; i >= 0; --i) { if (degree[org[i]] > 0) { return false; // the last node should have 0 degree } for (auto p : graph[org[i]]) { if (--degree[p] == 0 && p != org[i-1]) { // found a node that is not supposed to have 0 degree return false; } } } return true; }};
- [Leetcode] 444. Sequence Reconstruction 解题报告
- LeetCode 444. Sequence Reconstruction
- LeetCode 406. Queue Reconstruction by Height 解题报告
- [leetcode] 406. Queue Reconstruction by Height 解题报告
- Leetcode解题报告:406. Queue Reconstruction by Height
- LeetCode解题报告 406. Queue Reconstruction by Height [medium]
- [LeetCode]406. Queue Reconstruction by Height 解题报告
- [Leetcode] 406. Queue Reconstruction by Height 解题报告
- [LeetCode]Longest Consecutive Sequence, 解题报告
- 【LeetCode】Longest Consecutive Sequence 解题报告
- [leetcode] 128. Longest Consecutive Sequence 解题报告
- [leetcode] 60. Permutation Sequence 解题报告
- [Leetcode] 60. Permutation Sequence 解题报告
- [Leetcode] 128. Longest Consecutive Sequence 解题报告
- [leetcode]60. Permutation Sequence@Java解题报告
- 444. Sequence Reconstruction
- 444. Sequence Reconstruction
- Leetcode 406. Queue Reconstruction by Height 排队重构 解题报告
- git 远程仓库 回退
- ElasticSearch优化系列三:索引过程
- SSL证书生成
- 国家标准线
- 分析共享池脚本
- [Leetcode] 444. Sequence Reconstruction 解题报告
- JZOJsenior4323.【NOIP2015提高组Day1】神奇的幻方
- Android-->圆角图片,圆角任意View,圆角父布局Layout(任意形状的View且超简洁实现)
- (案例六)三种scrapy模拟登陆策略
- eclipse 全文搜索
- JQuery3.1.1源码解读(十六)【dom-html】
- bootstrapValidator的GitHub项目,zTree的码云项目
- Selective Search for object recognition
- Spark SQL利器:cacheTable/uncacheTable