LeetCode - 251展开二维向量（设计迭代器双指针）*

三岁就很萌@D

已于 2022-05-23 19:29:16 修改

阅读量239

点赞数

分类专栏： leetcode 设计文章标签： leetcode 算法 java

于 2022-05-23 09:53:29 首次发布

本文链接：https://blog.csdn.net/qq_44822951/article/details/124920274

版权

leetcode 同时被 2 个专栏收录

151 篇文章

订阅专栏

设计

23 篇文章

订阅专栏

在这里插入图片描述

class Vector2D {
    List<Integer> list = new ArrayList<>();//将二维向量存放到一维数组中
    int pos = 0;
    public Vector2D(int[][] vec) {
        for(int[] v: vec){
            for(int n : v){
                list.add(n);
            }
        }
    }
    
    public int next() {
       int res = list.get(pos);
       pos++;//指针向后移
       return res;
    }
    
    public boolean hasNext() {
        return pos < list.size();
    }
}

/**
 * Your Vector2D object will be instantiated and called as such:
 * Vector2D obj = new Vector2D(vec);
 * int param_1 = obj.next();
 * boolean param_2 = obj.hasNext();
 */

双指针

在这里插入图片描述

import java.util.NoSuchElementException;
class Vector2D {
    private int[][] vector;
    private int outer = 0;
    private int inner = 0;
    public Vector2D(int[][] vec) {
         vector = vec;
    }
    public void advanceNext(){
        while(outer < vector.length && inner == vector[outer].length){
            outer += 1;
            inner = 0;
        }
    }
    public int next() {
        if(!hasNext())
            throw new NoSuchElementException();
        return vector[outer][inner++];
    }
    
    public boolean hasNext() {
        advanceNext();
        return outer < vector.length;
    }
}

/**
 * Your Vector2D object will be instantiated and called as such:
 * Vector2D obj = new Vector2D(vec);
 * int param_1 = obj.next();
 * boolean param_2 = obj.hasNext();
 */