feat: add the solution of Toeplitz Matrix(766) with Java.

Author: Mukyu

README.md

@@ -88,7 +88,7 @@
 | [746][746-question] | [Min Cost Climbing Stairs][746-tips]                         | [✅][746-java] | [✅][746-js] |                  |
 | [747][747-question] | [Largest Number At Least Twice of Others][747-tips]          | [✅][747-java] | [✅][747-js] |                  |
 | [762][762-question] | [Prime Number of Set Bits in Binary Representation][762-tips]| [✅][762-java] | [✅][762-js] |                  |
-| [766][766-question] | [Toeplitz Matrix][766-tips]                                  |                | [✅][766-js] |                  |
+| [766][766-question] | [Toeplitz Matrix][766-tips]                                  | [✅][766-java] | [✅][766-js] |                  |
 | [771][771-question] | [Jewels and Stones][771-tips]                                | [✅][771-java] | [✅][771-js] | [✅][771-kotlin] |
 | [783][783-question] | [Minimum Distance Between BST Nodes][783-tips]               |                | [✅][783-js] |                  |
 | [784][784-question] | [Letter Case Permutation][784-tips]                          |                | [✅][784-js] |                  |
@@ -486,6 +486,7 @@
 [746-java]: ./src/_746/Solution.java
 [747-java]: ./src/_747/Solution.java
 [762-java]: ./src/_762/Solution.java
+[762-java]: ./src/_766/Solution.java
 [771-java]: ./src/_771/Solution.java
 [804-java]: ./src/_804/Solution.java
 

src/_766/Solution.java

@@ -0,0 +1,22 @@
+package _766;
+
+class Solution {
+    public boolean isToeplitzMatrix(int[][] matrix) {
+        int h = matrix.length - 1;
+        int w = matrix[0].length - 1;
+        for (int i = 0; i < h; i++) {
+            for (int j = 0; j < w; j++) {
+                if (matrix[i][j] != matrix[i + 1][j + 1]) {
+                    return false;
+                }
+            }
+        }
+        return true;
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+        System.out.println(solution.isToeplitzMatrix(new int[][]{{1, 2}, {2, 2}}));
+        System.out.println(solution.isToeplitzMatrix(new int[][]{{1, 2, 3, 4}, {5, 1, 2, 3}, {9, 5, 1, 2}}));
+    }
+}

tips/766/README.md

@@ -1,46 +1,67 @@
-[xxxx][title]
+[Toeplitz Matrix][title]
 
 ## Description
-// 抄题目
 
+A matrix is *Toeplitz* if every diagonal from top-left to bottom-right has the same element.
 
-**Example:**
+Now given an `M x N` matrix, return `True` if and only if the matrix is *Toeplitz*.
+
+**Example 1:**
 
 ```
-// 抄Example
+Input: matrix = [[1,2,3,4],[5,1,2,3],[9,5,1,2]]
+Output: True
+Explanation:
+1234
+5123
+9512
+
+In the above grid, the diagonals are "[9]", "[5, 5]", "[1, 1, 1]", "[2, 2, 2]", "[3, 3]", "[4]", and in each diagonal all elements are the same, so the answer is True.
 ```
 
-**Note:**
-// Note
+**Example 2:**
 
-**Tags:** // tags
+```
+Input: matrix = [[1,2],[2,2]]
+Output: False
+Explanation:
+The diagonal "[1, 2]" has different elements.
+```
 
+**Note:**
 
-## 思路 1
-// 贴一些关键代码,说一些解题思路
-// (同一种语言可以写多种思路，与某种语言思路相同的另一种语言的思路无须赘述，但可以把代码贴在后面) 
-```java
+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]`.
 
-```
-```javascript
+**Tags:** [Array](https://leetcode.com/tag/array/)
 
-```
+## 思路
 
-## 思路 2
-// 贴一些关键代码,说一些解题思路
-```java
+给出一个二维数组，判断每一条左上至右下的对角线上的数是否是一致的。
 
-```
+遍历数组，判断每个数是否与其右下角的数一致即可。注意边界判断。
 
-## 思路 3
-// 贴一些关键代码,说一些解题思路
-```kotlin
+**Java:**
 
+```java
+public boolean isToeplitzMatrix(int[][] matrix) {
+    int h = matrix.length - 1;
+    int w = matrix[0].length - 1;
+    for (int i = 0; i < h; i++) {
+        for (int j = 0; j < w; j++) {
+            if (matrix[i][j] != matrix[i + 1][j + 1]) {
+                return false;
+            }
+        }
+    }
+    return true;
+}
 ```
 
 ## 结语
-   
+
 如果你同我们一样热爱数据结构、算法、LeetCode，可以关注我们 GitHub 上的 LeetCode 题解：[LeetCode-Solution][ls]
 
-[title]: https://leetcode.com/problems/xxxx
+[title]: https://leetcode.com/problems/toeplitz-matrix/description/
 [ls]: https://github.com/RichCodersAndMe/LeetCode-Solution