Given a nested list of integers, implement an iterator to flatten it.
Each element is either an integer, or a list -- whose elements may also be integers or other lists.
Example
出错的input是[[],[]]。暂时没有找到原因。查了一下,http://www.programcreek.com/2014/05/leetcode-flatten-nested-list-iterator-java/的代码原理类似。只是把出栈检查放到hasNext中。代码如下:
-
Given the list
[[1,1],2,[1,1]]
, By calling next repeatedly until hasNext returns false, the order of elements returned by next should be:[1,1,2,1,1]
. -
Given the list
[1,[4,[6]]]
, By calling next repeatedly until hasNext returns false, the order of elements returned by next should be:[1,4,6]
.
想法是用stack倒序储存NestedInteger。每次next时取栈顶。前提是保证stack中的NestedInteger的list不为空,不然在hasNext中判断isEmpty时,假如stack中有一个含空list的
NestedInteger,会出错。代码如下,无法通过所有测试用例。
<pre name="code" class="java">public class NestedIterator implements Iterator<Integer> {
Stack<NestedInteger> res = new Stack<NestedInteger>();
public NestedIterator(List<NestedInteger> nestedList) {
if(nestedList == null) return;
for(int i = nestedList.size() - 1; i >= 0; i--) {
if(nestedList.get(i).isInteger() == true || nestedList.get(i).getList().size() != 0)
res.push(nestedList.get(i));
}
}
// @return {int} the next element in the iteration
@Override
public Integer next() {
NestedInteger top = res.pop();
while(top.getInteger() == null) {
List<NestedInteger> tmp = top.getList();
for(int i = tmp.size() - 1; i >= 0; i--) {
if(tmp.get(i).isInteger() == true ||
tmp.get(i).getList().size() != 0)
res.push(tmp.get(i));
}
top = res.peek(); res.pop();
}
return top.getInteger();
}
// @return {boolean} true if the iteration has more element or false
@Override
public boolean hasNext() {
return !res.isEmpty();
}
@Override
public void remove() {}
}
出错的input是[[],[]]。暂时没有找到原因。查了一下,http://www.programcreek.com/2014/05/leetcode-flatten-nested-list-iterator-java/的代码原理类似。只是把出栈检查放到hasNext中。代码如下:
public class NestedIterator implements Iterator<Integer> {
Stack<NestedInteger> stack = new Stack<NestedInteger>();
public NestedIterator(List<NestedInteger> nestedList) {
if(nestedList==null)
return;
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 top = stack.peek();
if(top.isInteger()){
return true;
}else{
stack.pop();
for(int i=top.getList().size()-1; i>=0; i--){
stack.push(top.getList().get(i));
}
}
}
return false;
}
}