leetcode周赛补完计划（七）

周赛139

1071. 字符串的最大公因子

解题思路：辗转相除

public String gcdOfStrings(String str1, String str2) {
    while (str1.length() >0 && str2.length() > 0){
        if(str1.length() < str2.length()){
            String temp2 = str1;
            str1 = str2;
            str2 = temp2;
        }
        if(str1.indexOf(str2) < 0){
            return "";
        } else {
            str1 = str1.substring(str1.indexOf(str2) + str2.length());
        }
    }
    return (str1.length() == 0)?str2:str1;
}

1072. 按列翻转得到最大值等行数

解题思路：两行数字，经过列的反转，最后使值相同，那么这两行数字的关系有两种情况：两行数字的值都相同；两行数字的值都相反。

public int maxEqualRowsAfterFlips(int[][] matrix) {
    int row = matrix.length;
    int col = matrix[0].length;
    int res = 0;
    for(int i = 0;i < row;i++){
        if(matrix[i][0] == 2)
            continue;
        int count = 0;
        for(int j = i;j < row;j++){
            if(matrix[j][0] == 2)
                continue;
            int z = 0;
            if(matrix[i][0] == matrix[j][0]){
                while (z < col){
                    if(matrix[i][z] == matrix[j][z]){
                        z++;
                    }
                    else
                        break;
                }
            } else {
                while (z < col) {
                    if (matrix[i][z] == (matrix[j][z] ^ 1)) {
                        z++;
                    }
                    else
                        break;
                }
            }
            if(z == col){
                count++;
                if(j != i ){
                    matrix[j][0] = 2;
                }
            }
        }
        res = Math.max(res,count);
    }
    return res;
}

1073. 负二进制数相加

解题思路：关键在于进位的处理，当前位求和大于1时进位为-1，小于0时进位为1.

public int[] addNegabinary(int[] arr1, int[] arr2) {
    int l1 = arr1.length;
    int l2 = arr2.length;
    ArrayList<Integer> sum = new ArrayList<>();
    int carry = 0;
    for(int i = l1 - 1,j = l2 - 1;i >= 0 || j >= 0 || carry != 0;i--,j--){
        int x = 0,y = 0;
        if(i >= 0){
            x = arr1[i];
        }
        if(j >= 0){
            y = arr2[j];
        }
        if(x + y + carry > 1){
            sum.add((x + y + carry) % 2);
            carry = -1;
        }else if(x + y + carry < 0){
            sum.add(1);
            carry = 1;
        }else {
            sum.add(x + y + carry);
            carry = 0;
        }
    }
   
    for(int i = sum.size() - 1;i >= 1;i--){
        if(sum.get(i) != 0)
            break;
        sum.remove(i);
    }
    
    int len = sum.size();
    int[] res = new int[len];
    for(int i = 0;i < len;i++){
        res[len - 1 - i] = sum.get(i);
    }
    return res;
}

1074. 元素和为目标值的子矩阵数量

解题思路：对矩阵求和：matrix[i][j] = matrix[i][0]+…+matrix[i][j]，maxtrix[i][j]表示第i行前j列的和，那么矩阵和等于行区间matrix[i][k] - matrix[i][j-1]的和，保留前i行的和sum方便之后查询。

public int numSubmatrixSumTarget(int[][] matrix, int target) {
    int col = matrix[0].length;
    int row = matrix.length;
    int res = 0;
    HashMap<Integer,Integer> hash = new HashMap<>();
    for(int i = 0;i < row;i++) {
        for(int j = 0;j < col - 1;j++){
            matrix[i][j+1] += matrix[i][j];
        }
    }

    for(int j = 0;j < col;j++){
        for(int k = j;k < col;k++){
            int cursum = 0;
            hash.clear();
            hash.put(0,1);
            for(int i = 0;i < row;i++){
                if(j > 0){
                    cursum += matrix[i][k] - matrix[i][j-1];
                }
                else {
                    cursum += matrix[i][k];
                }
                if(hash.containsKey(cursum - target)){
                    res += hash.get(cursum - target);
                }
                if(hash.containsKey(cursum)){
                    hash.replace(cursum,hash.get(cursum)+1);
                }
                else {
                    hash.put(cursum,1);
                }
            }
        }
    }
    return res;
}