737. 查找矩阵

737. 查找矩阵

 

给一矩阵, 找到矩阵中每一行都出现的元素. 你可以假设矩阵中只有一个满足条件的元素.

样例

样例 1:

输入 :

[

[2,5,3],

[3,2,1],

[1,3,5]

]

输出 : 3

 

 

 

public class Solution {

    /**

     * @param Matrix: the input

     * @return: the element which appears every row

     */

    public int FindElements(int[][] Matrix) {

        // write your code here

              ArrayList<Integer> integers=new ArrayList<>();

            for (int i = 0; i < Matrix[0].length; i++) {

                integers.add(Matrix[0][i]);

            }

            ArrayList<Integer> ret=new ArrayList<>();

            for (int i = 1; i < Matrix.length; i++) {

                ret.clear();

                for (int j = 0; j <  Matrix[i].length; j++) {

                    if (integers.contains(Matrix[i][j])){

                        ret.add(Matrix[i][j]);

                    }

                }

                integers.clear();

                integers.addAll(ret);

            }

            return integers.get(0);

    }

}