From 185ef9fcb0e59f13e9ee0ccb261693cdaddebab0 Mon Sep 17 00:00:00 2001
From: crupest <crupest@outlook.com>
Date: Tue, 23 Feb 2021 21:07:19 +0800
Subject: import(solutions): Move leetcode solutions to subdir.

---
 works/solutions/leetcode/cpp/766.cpp | 44 ++++++++++++++++++++++++++++++++++++
 1 file changed, 44 insertions(+)
 create mode 100644 works/solutions/leetcode/cpp/766.cpp

(limited to 'works/solutions/leetcode/cpp/766.cpp')

diff --git a/works/solutions/leetcode/cpp/766.cpp b/works/solutions/leetcode/cpp/766.cpp
new file mode 100644
index 0000000..3e8a015
--- /dev/null
+++ b/works/solutions/leetcode/cpp/766.cpp
@@ -0,0 +1,44 @@
+#include <algorithm>
+#include <vector>
+
+using std::vector;
+
+class Solution {
+public:
+  bool isToeplitzMatrix(vector<vector<int>> &matrix) {
+    int row_count = matrix.size();
+    int col_count = matrix.front().size();
+
+    if (matrix.size() == 1)
+      return true;
+    if (matrix.front().size() == 1)
+      return true;
+
+    // offset = col - row
+    // max(offset) = row_count - 2
+    // min(offset) = -(col_count - 2)
+    for (int offset = -(col_count - 2); offset <= (row_count - 2); offset++) {
+      int row, col;
+      if (offset >= 0) {
+        row = offset;
+        col = 0;
+      } else {
+        row = 0;
+        col = -offset;
+      }
+
+      int value = matrix[row][col];
+      row++;
+      col++;
+
+      while (row < row_count && col < col_count) {
+        if (matrix[row][col] != value) {
+          return false;
+        }
+        row++;
+        col++;
+      }
+    }
+    return true;
+  }
+};
-- 
cgit v1.2.3