zoukankan      html  css  js  c++  java
  • LeetCode 766. Toeplitz Matrix

    原题链接在这里:https://leetcode.com/problems/toeplitz-matrix/

    题目:

    A matrix is Toeplitz if every diagonal from top-left to bottom-right has the same element.

    Now given an M x N matrix, return True if and only if the matrix is Toeplitz.
     

    Example 1:

    Input:
    matrix = [
      [1,2,3,4],
      [5,1,2,3],
      [9,5,1,2]
    ]
    Output: True
    Explanation:
    In the above grid, the diagonals are:
    "[9]", "[5, 5]", "[1, 1, 1]", "[2, 2, 2]", "[3, 3]", "[4]".
    In each diagonal all elements are the same, so the answer is True.
    

    Example 2:

    Input:
    matrix = [
      [1,2],
      [2,2]
    ]
    Output: False
    Explanation:
    The diagonal "[1, 2]" has different elements.

    Note:

    1. matrix will be a 2D array of integers.
    2. matrix will have a number of rows and columns in range [1, 20].
    3. matrix[i][j] will be integers in range [0, 99].


    Follow up:

      1. What if the matrix is stored on disk, and the memory is limited such that you can only load at most one row of the matrix into the memory at once?
      2. What if the matrix is so large that you can only load up a partial row into the memory at once?

    题解:

    Check if current cell value == lower right cell value.

    Time Complexity: O(m * n). m = matrix.length. n = matrix[0].length.

    Space: (1).

    AC Java:

     1 class Solution {
     2     public boolean isToeplitzMatrix(int[][] matrix) {
     3         if(matrix == null){
     4             return true;
     5         }
     6         
     7         int m = matrix.length;
     8         int n = matrix[0].length;
     9         for(int i = 0; i<m-1; i++){
    10             for(int j = 0; j<n-1; j++){
    11                 if(matrix[i][j] != matrix[i+1][j+1]){
    12                     return false;
    13                 }
    14             }
    15         }
    16         
    17         return true;
    18     }
    19 }

    类似Valid Word Square.

  • 相关阅读:
    【转】算法的时间复杂度
    FFT 物理意义(转)
    【转】FIR学习1
    【转】DFT DTFT DFS FFT的关系
    【转】TCL中的数组
    【转】setup time和hold time的周期问题(slack)
    【转】TCL语法简介
    【转】亚稳态分析
    ubuntu下Samba服务器搭建
    第一次生成uImage出现的问题解决
  • 原文地址:https://www.cnblogs.com/Dylan-Java-NYC/p/12047676.html
Copyright © 2011-2022 走看看