zoukankan      html  css  js  c++  java
  • 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 repeatedly until hasNext returns false, the order of elements returned by next should be: [1,2,3,4,5,6].

    Hint:

    1. How many variables do you need to keep track?
    2. Two variables is all you need. Try with x and y.
    3. Beware of empty rows. It could be the first few rows.
    4. To write correct code, think about the invariant to maintain. What is it?
    5. The invariant is x and y must always point to a valid point in the 2d vector. Should you maintain your invariant ahead of time or right when you need it?
    6. Not sure? Think about how you would implement hasNext(). Which is more complex?
    7. Common logic in two different places should be refactored into a common method.

    Follow up:
    As an added challenge, try to code it using only iterators in C++ or iterators in Java.

     解法一:without iterator

    public class Vector2D implements Iterator<Integer> {
        
        int indexList;
        int indexEle;
        List<List<Integer>> vec;
    
        public Vector2D(List<List<Integer>> vec2d) {
            indexList = 0;
            indexEle = 0;
            vec = vec2d;
        }
    
        @Override
        public Integer next() {
            hasNext();
            return vec.get(indexList).get(indexEle++);
        }
    
        @Override
        public boolean hasNext() {
            while(indexList<vec.size())
            {
                if(indexEle<vec.get(indexList).size()) return true;
                else
                {
                    indexList++;
                    indexEle=0;
                }
            }
            return false;
        }
        
        
        
    }
    
    /**
     * Your Vector2D object will be instantiated and called as such:
     * Vector2D i = new Vector2D(vec2d);
     * while (i.hasNext()) v[f()] = i.next();
     */

    解法二:with iterator

    public class Vector2D implements Iterator<Integer> {
    
        private Iterator<List<Integer>> i;
        private Iterator<Integer> j;
    
        public Vector2D(List<List<Integer>> vec2d) {
            i = vec2d.iterator();
        }
    
        public Integer next() {
            hasNext();
            return j.next();
        }
    
        public boolean hasNext() {
            while ((j == null || !j.hasNext()) && i.hasNext())
                j = i.next().iterator();
            return j != null && j.hasNext();
        }
    }
    
    /**
     * Your Vector2D object will be instantiated and called as such:
     * Vector2D i = new Vector2D(vec2d);
     * while (i.hasNext()) v[f()] = i.next();
     */

    reference:

    https://discuss.leetcode.com/topic/20697/7-9-lines-added-java-and-c-o-1-space/2

  • 相关阅读:
    用户及文件权限管理
    Linux基础操作及概念
    监督学习和非监督学习
    基于仿生算法的智能系统I
    9.Dijkstra求最短路 II 堆优化的Dijkstra
    8.Dijkstra求最短路 I 朴素Dijkstra
    7.有向图的拓扑序列 拓扑排序
    6.树与图的广度优先遍历 图中点的层次
    5.树的重心 树与图的深度优先遍历
    4.八数码 BFS
  • 原文地址:https://www.cnblogs.com/hygeia/p/5774953.html
Copyright © 2011-2022 走看看