迭代器
文章平均质量分 80
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 281. Zigzag Iterator(之字形迭代器)
原题网址:https://leetcode.com/problems/zigzag-iterator/ Given two 1d vectors, implement an iterator to return their elements alternately. For example, given two 1d vectors: v1 = [1, 2] v2 = [3, 4原创 2016-04-14 07:40:12 · 981 阅读 · 0 评论 -
LeetCode 284. Peeking Iterator(支持peek的迭代器)
原题网址:https://leetcode.com/problems/peeking-iterator/ Given an Iterator class interface with methods: next() and hasNext(), design and implement a PeekingIterator that support the peek() operati原创 2016-04-14 10:29:18 · 904 阅读 · 0 评论 -
LeetCode 173. Binary Search Tree Iterator(二叉搜索树迭代器)
原题网址:https://leetcode.com/problems/binary-search-tree-iterator/ Implement an iterator over a binary search tree (BST). Your iterator will be initialized with the root node of a BST. Calling ne原创 2016-05-25 01:36:36 · 1480 阅读 · 0 评论 -
LeetCode 341. Flatten Nested List Iterator(嵌套列表迭代器)
原题网址:https://leetcode.com/problems/flatten-nested-list-iterator/ Given a nested list of integers, implement an iterator to flatten it. Each element is either an integer, or a list -- whose ele原创 2016-04-30 10:15:08 · 1402 阅读 · 0 评论 -
LeetCode 251. Flatten 2D Vector(摊平二维向量)
原题网址:https://leetcode.com/problems/flatten-2d-vector/ Implement an iterator to flatten a 2d vector. For example, Given 2d vector = [ [1,2], [3], [4,5,6] ] By calling next repea原创 2016-04-07 14:13:16 · 1388 阅读 · 0 评论 -
LeetCode 31. Next Permutation(下一个排列)
原题网址:https://leetcode.com/problems/next-permutation/ Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is原创 2016-05-20 10:36:39 · 409 阅读 · 0 评论 -
LeetCode 73. Set Matrix Zeroes(矩阵清零)
原题网址:https://leetcode.com/problems/set-matrix-zeroes/ Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. click to show follow up. Follow up: Did原创 2016-05-22 05:18:55 · 693 阅读 · 0 评论