331. Verify Preorder Serialization of a Binary Tree | Java最短代码实现
来源:互联网 发布:高新技术软件产业园 编辑:程序博客网 时间:2024/06/05 07:01
原题链接:331. Verify Preorder Serialization of a Binary Tree
【思路】
本题考查字符串的操作和树的基本概念。注意题目要求构造一个完整的树,所有叶子节点都要以#结束,也就是"9,#,#"满足要求,二"9,#"和”9"不满足。本题中在字符串前面加了一个逗号,目的是在每次遇到逗号之后,判断下一个字符为空或数字(有可能不止一位,如"9,#,98,#,#"):
public boolean isValidSerialization(String preorder) { int curCount = 0; int curShouldCount = 1; int nextShouldCount = 0; int i = 0; preorder = "," + preorder; for (; i < preorder.length(); i++) { if (preorder.charAt(i) == ',') { if (preorder.charAt(i + 1) != '#') nextShouldCount += 2; if (++curCount == curShouldCount) { if (nextShouldCount == 0) break; curShouldCount = nextShouldCount; nextShouldCount = 0; curCount = 0; } } } return i + 2 == preorder.length() && curCount == curShouldCount; }150 / 150 test cases passed. Runtime: 5 ms Your runtime beats 98.04% of javasubmissions.
欢迎优化!
1 0
- 331. Verify Preorder Serialization of a Binary Tree | Java最短代码实现
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- Verify Preorder Serialization of a Binary Tree
- 331. Verify Preorder Serialization of a Binary Tree
- leetcode 331. Verify Preorder Serialization of a Binary Tree
- [LeetCode]331. Verify Preorder Serialization of a Binary Tree
- 331. Verify Preorder Serialization of a Binary Tree
- 【LeetCode】331. Verify Preorder Serialization of a Binary Tree
- 331. Verify Preorder Serialization of a Binary Tree
- LeetCode 331. Verify Preorder Serialization of a Binary Tree
- android自定义控件
- Java经典设计模式之七大结构型模式
- CentOS No package nginx available.
- 关于Class.getResource和ClassLoader.getResource的路径问题
- ReentrantLock详解
- 331. Verify Preorder Serialization of a Binary Tree | Java最短代码实现
- apache shiro集群实现(一) session共享
- try/catch、throws和throw
- vb作业
- 对于 前K短路径问题 和 A*算法 的一些小小总结
- apache shiro集群实现(二)— cache共享
- 用户反馈怎么用?千万别按照用户的要求直接设计产品!
- ISR和DPC
- LeetCode 13 Roman to Integer