341:扁平化嵌套列表迭代器

LeetCode/src/main/java/leetcode/editor/cn/FlattenNestedListIterator.java

@@ -0,0 +1,95 @@
+//给你一个嵌套的整型列表。请你设计一个迭代器，使其能够遍历这个整型列表中的所有整数。 
+//
+// 列表中的每一项或者为一个整数，或者是另一个列表。其中列表的元素也可能是整数或是其他列表。 
+//
+// 
+//
+// 示例 1: 
+//
+// 输入: [[1,1],2,[1,1]]
+//输出: [1,1,2,1,1]
+//解释: 通过重复调用 next 直到 hasNext 返回 false，next 返回的元素的顺序应该是: [1,1,2,1,1]。 
+//
+// 示例 2: 
+//
+// 输入: [1,[4,[6]]]
+//输出: [1,4,6]
+//解释: 通过重复调用 next 直到 hasNext 返回 false，next 返回的元素的顺序应该是: [1,4,6]。
+// 
+// Related Topics 栈 设计 
+// 👍 324 👎 0
+
+package leetcode.editor.cn;
+
+import com.code.leet.entiy.NestedInteger;
+
+import java.util.ArrayList;
+import java.util.Iterator;
+import java.util.List;
+
+//341:扁平化嵌套列表迭代器
+public class FlattenNestedListIterator {
+    public static void main(String[] args) {
+        //测试代码
+//        Solution solution = new FlattenNestedListIterator().new Solution();
+    }
+    //力扣代码
+    //leetcode submit region begin(Prohibit modification and deletion)
+
+    /**
+     * // This is the interface that allows for creating nested lists.
+     * // You should not implement it, or speculate about its implementation
+     * public interface NestedInteger {
+     * <p>
+     * // @return true if this NestedInteger holds a single integer, rather than a nested list.
+     * public boolean isInteger();
+     * <p>
+     * // @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();
+     * <p>
+     * // @return the nested list that this NestedInteger holds, if it holds a nested list
+     * // Return empty list if this NestedInteger holds a single integer
+     * public List<NestedInteger> getList();
+     * }
+     */
+    public class NestedIterator implements Iterator<Integer> {
+
+        private List<Integer> list = new ArrayList<>();
+        private int index = 0;
+
+        public NestedIterator(List<NestedInteger> nestedList) {
+            getList(nestedList);
+        }
+
+        private void getList(List<NestedInteger> nestedList) {
+            for (NestedInteger nestedInteger : nestedList) {
+                if (nestedInteger.isInteger()) {
+                    list.add(nestedInteger.getInteger());
+                } else {
+                    getList(nestedInteger.getList());
+                }
+            }
+        }
+
+        @Override
+        public Integer next() {
+            int num = list.get(index);
+            index++;
+            return num;
+        }
+
+        @Override
+        public boolean hasNext() {
+            return index< list.size();
+        }
+    }
+
+/**
+ * Your NestedIterator object will be instantiated and called as such:
+ * NestedIterator i = new NestedIterator(nestedList);
+ * while (i.hasNext()) v[f()] = i.next();
+ */
+//leetcode submit region end(Prohibit modification and deletion)
+
+}

LeetCode/src/main/java/leetcode/editor/cn/FlattenNestedListIterator.md

@@ -0,0 +1,19 @@
+<p>给你一个嵌套的整型列表。请你设计一个迭代器，使其能够遍历这个整型列表中的所有整数。</p>
+
+<p>列表中的每一项或者为一个整数，或者是另一个列表。其中列表的元素也可能是整数或是其他列表。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入: </strong>[[1,1],2,[1,1]]
+<strong>输出: </strong>[1,1,2,1,1]
+<strong>解释: </strong>通过重复调用&nbsp;<em>next </em>直到&nbsp;<em>hasNex</em>t 返回 false，<em>next&nbsp;</em>返回的元素的顺序应该是: <code>[1,1,2,1,1]</code>。</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入: </strong>[1,[4,[6]]]
+<strong>输出: </strong>[1,4,6]
+<strong>解释: </strong>通过重复调用&nbsp;<em>next&nbsp;</em>直到&nbsp;<em>hasNex</em>t 返回 false，<em>next&nbsp;</em>返回的元素的顺序应该是: <code>[1,4,6]</code>。
+</pre>
+<div><div>Related Topics</div><div><li>栈</li><li>设计</li></div></div>\n<div><li>👍 324</li><li>👎 0</li></div>