LeetCode 341: Flatten Nested List Iterator
Posted keepshuatishuati
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode 341: Flatten Nested List Iterator相关的知识,希望对你有一定的参考价值。
/** * // This is the interface that allows for creating nested lists. * // You should not implement it, or speculate about its implementation * public interface NestedInteger { * * // @return true if this NestedInteger holds a single integer, rather than a nested list. * public boolean isInteger(); * * // @return the single integer that this NestedInteger holds, if it holds a single integer * // Return null if this NestedInteger holds a nested list * public Integer getInteger(); * * // @return the nested list that this NestedInteger holds, if it holds a nested list * // Return null if this NestedInteger holds a single integer * public List<NestedInteger> getList(); * } */ public class NestedIterator implements Iterator<Integer> { Stack<NestedInteger> stack; public NestedIterator(List<NestedInteger> nestedList) { stack = new Stack<>(); pushData(nestedList); } @Override public Integer next() { return stack.pop().getInteger(); } @Override public boolean hasNext() { while(!stack.isEmpty()) { if (stack.peek().isInteger()) { return true; } pushData(stack.pop().getList()); } return false; } private void pushData(List<NestedInteger> nestedList) { for (int i = nestedList.size() - 1; i >= 0; i--) { stack.push(nestedList.get(i)); } } } /** * Your NestedIterator object will be instantiated and called as such: * NestedIterator i = new NestedIterator(nestedList); * while (i.hasNext()) v[f()] = i.next(); */
1 Remember : Always make integer validation at hasNext() since it is too late to validate it at next().
以上是关于LeetCode 341: Flatten Nested List Iterator的主要内容,如果未能解决你的问题,请参考以下文章
[leetcode] 341. Flatten Nested List Iterator
leetcode341. Flatten Nested List Iterator
[leetcode]341. Flatten Nested List Iterator 展开嵌套列表的迭代器
341. Flatten Nested List Iterator