2923. Find Champion I 

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
    public int findChampion(int[][] grid) {
        int n = grid.length;

        for (int i = 0; i < n; i++) {
            int win = 0;
            for (int j = 0; j < n; j++) {
                if (i == j) {
                    continue;
                }

                if (grid[i][j] == 1) {
                    win++;
                }
            }
            if (win == n - 1) {
                return i;
            }
        }

        return -1;
    }
}
1
2
3
4
5
6
7
8
9
10
11
12
13
class Solution {
    public int findChampion(int[][] grid) {
        int ans = 0;

        for (int i = 1; i < grid.length; i++) {
            if (grid[i][ans] == 1) {
                ans = i;
            }
        }

        return ans;
    }
}

References

2923. Find Champion I