题解 | #二维数组中的查找#

import java.util.*;

public class Solution {
    public boolean Find(int target, int [][] array) {
        ArrayList<Integer> numList = new ArrayList<>();
        for (int i = 0; i < array.length; i++) {
            if (array.length == 0) {
                return false;
            }
            for (int j = 0; j < array[i].length; j++) {
                numList.add(array[i][j]);
            }
        }
        if (numList.contains(target)) {
            return  true;
        } else
            return false;
    }
}