LeetCode 第165周赛

T1:1275. 找出井字棋的获胜者

解题思路：主要就是判断一下胜利的情况(棋盘格子有限，且不能重复下到一个位置)，这里直接判断了所有的情况。

    public String tictactoe(int[][] moves) {
        int flag = 0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][0] == 0 && moves[i][1]<=2){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][0] == 1 && moves[i][1]<=2){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][0] == 2 && moves[i][1]<=2){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][1] == 0 && moves[i][0]<=2){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][1] == 1 && moves[i][0]<=2){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][1] == 2 && moves[i][0]<=2){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][0] == moves[i][1]){
                flag++;
            }
        }
        if (flag==3)return "A";
        flag=0;
        
        for (int i = 0; i < moves.length; i=i+2) {
            if (moves[i][0] == 1 && moves[i][1] == 1 || moves[i][0] == 0 && moves[i][1] == 2 ||moves[i][0] == 2 && moves[i][1] == 0){
                flag++;
            }
        }
        if (flag==3)return "A";


        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][0] == 0 && moves[i][1]<=2){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][0] == 1 && moves[i][1]<=2){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][0] == 2 && moves[i][1]<=2){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][1] == 0 && moves[i][0]<=2){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][1] == 1 && moves[i][0]<=2){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][1] == 2 && moves[i][0]<=2){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][0] == moves[i][1]){
                flag++;
            }
        }
        if (flag==3)return "B";
        flag=0;
        for (int i = 1; i < moves.length; i=i+2) {
            if (moves[i][0] == 1 && moves[i][1] == 1 || moves[i][0] == 0 && moves[i][1] == 2 ||moves[i][0] == 2 && moves[i][1] == 0){
                flag++;
            }
        }
        if (flag==3)return "B";
        return moves.length>=9?"Draw":"Pending";
    }

T2:1276. 不浪费原料的汉堡制作方案

解题思路：由于每一个汉堡中都只需要一个奶酪，所以直接利用小皇堡的参数来判断会多出多少个番茄的个数，如果番茄剩余为负数，则会被浪费;如果番茄剩余数为单数，则也会被浪费;巨无霸汉堡的个数就是剩余番茄的个数除于2。

    public List numOfBurgers(int tomatoSlices, int cheeseSlices) {
        List<Integer> res = new ArrayList<>();
        int shuould = cheeseSlices * 2;
        if (shuould>tomatoSlices) return res;
        int base = (tomatoSlices-shuould);
        if (base%2!=0) return res;
        base/=2;
        
        int min = (tomatoSlices-4*base)/2;
        if (min<0) return res;
        res.add(base);
        res.add(min);
        return res;
    }

T3:1277. 统计全为 1 的正方形子矩阵

解题思路：由于数据量十分的小，可以直接用暴力法来做，直接遍历每个点的边长，来统计正方形矩阵个数(也能够使用二维前缀和来做😅)。

    public int countSquares(int[][] matrix) {
        int res = 0;
        int n = matrix.length;
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < n; j++) {
                for (int k = 0; k < matrix[j].length; k++) {
                    if (canMatrix(j,k,i,matrix)) res++;
                }
            }
        }
        return res;
    }
    public boolean canMatrix(int L,int R,int length,int matrix[][]){
        for (int i = L; i < L+length; i++) {
            for (int j = R; j < R+length; j++) {
                if (i>=matrix.length || j>=matrix[0].length) return false;
                if (matrix[i][j]==0)return false;
            }
        }
        return true;
    }