七月day1——数组

leetcode2319. 判断矩阵是否是一个X矩阵

解析一：

class Solution {
public:
    bool checkXMatrix(vector<vector<int>>& grid) {
       int n = grid.size();
       vector<int> result;
       for (int i = 0; i < n; i++) {
          if(grid[i][i] != 0 && grid[i][n-1-i] != 0) {
              grid[i][i] = 0;
              grid[i][n-1-i] = 0;
          } else {
              return false;
          }
       }
       for (int i = 0; i < n; i++) {
           for (int j = 0; j < n; j++) {
              if(grid[i][j] != 0) {
                  return false;
              }
           }
       }
       return true; 
    }
};
//主对角线 i=j  副对角线 i+j=n-1
//遍历矩阵元素 l

解析二：

leetcode599. 两个列表的最小索引和

解析一：

class Solution {
public:
    vector<string> findRestaurant(vector<string>& list1, vector<string>& list2) {
       vector<string> result;
       int ans, min = 1000000;
       for (int i = 0; i < list1.size(); i++) {
           for (int j = 0; j < list2.size(); j++) {
               if(list1[i] == list2[j]) {
                   ans = i + j;
                   if(ans < min) {
                       min = ans;
                       result = {list1[i]};
                   } else if (ans == min) {
                       result.push_back(list1[i]);
                   }
               } 
           }
       }
       return result;
    }
};
//result = { list1[i] } 和 result.push_back(list1[i])区别 一个是覆盖值 另一个是不断加载