LeetCode 341. Flatten Nested List Iterator
来源:互联网 发布:手机怎么关闭数据流量 编辑:程序博客网 时间:2024/05/14 09:47
/** * // 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 = new Stack<NestedInteger>(); public NestedIterator(List<NestedInteger> nestedList) { for (int i = nestedList.size() - 1; i >= 0; i--) stack.push(nestedList.get(i)); } @Override public Integer next() { return stack.pop().getInteger(); } @Override public boolean hasNext() { while (!stack.isEmpty()) { NestedInteger ni = stack.peek(); if (ni.isInteger()) return true; stack.pop(); List<NestedInteger> nestedList = ni.getList(); for (int i = nestedList.size() - 1; i >= 0; i--) stack.push(nestedList.get(i)); } return false; }}/** * Your NestedIterator object will be instantiated and called as such: * NestedIterator i = new NestedIterator(nestedList); * while (i.hasNext()) v[f()] = i.next(); */
0 0
- leetcode 341. Flatten Nested List Iterator
- [leetcode] 341. Flatten Nested List Iterator
- LeetCode 341. Flatten Nested List Iterator
- LeetCode 341. Flatten Nested List Iterator
- [leetcode] 341. Flatten Nested List Iterator
- LeetCode: 341. Flatten Nested List Iterator
- Leetcode 341. Flatten Nested List Iterator
- 【LeetCode】 341. Flatten Nested List Iterator
- leetcode 341. Flatten Nested List Iterator
- LeetCode 341. Flatten Nested List Iterator
- [leetcode]341. Flatten Nested List Iterator
- leetcode 341. Flatten Nested List Iterator
- leetcode 341. Flatten Nested List Iterator
- leetcode 341. Flatten Nested List Iterator
- Leetcode 341. Flatten Nested List Iterator
- LeetCode|Flatten Nested List Iterator
- [LeetCode] Flatten Nested List Iterator
- LeetCode:Flatten Nested List Iterator
- 数据结构---栈(数组实现)
- 二叉树建立,前序遍历,中序遍历,后序遍历 思路
- getParameter/geAttribute
- 白话经典算法系列之九 从归并排序到数列的逆序数对(微软笔试题)
- C++中的静态数据成员
- LeetCode 341. Flatten Nested List Iterator
- (第一,二章)软件质量,软件测试的概念
- Linux进度条
- ZOJ题目类型汇总
- 基于分布式列数据库的时空数据库——Geomesa
- cs231n-(6)实现Minimal神经网络
- 搜索实质
- 最短路径问题
- 数据结构---队列(数组实现)