diff options
| author | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
|---|---|---|
| committer | crupest <crupest@outlook.com> | 2021-02-23 21:07:19 +0800 |
| commit | e353213dfb73259a5d33cc6e9d5cd2373c683be9 (patch) | |
| tree | e879936e7e9c62f9946249cdeb470afeef1c1500 /works/solutions/leetcode/cpp/766-2.cpp | |
| parent | 7e3e89a3f0ecc49c33334f423dbde3a5fdc57abd (diff) | |
| download | crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.tar.gz crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.tar.bz2 crupest-e353213dfb73259a5d33cc6e9d5cd2373c683be9.zip | |
import(solutions): Move leetcode solutions to subdir.
Diffstat (limited to 'works/solutions/leetcode/cpp/766-2.cpp')
| -rw-r--r-- | works/solutions/leetcode/cpp/766-2.cpp | 20 |
1 files changed, 20 insertions, 0 deletions
diff --git a/works/solutions/leetcode/cpp/766-2.cpp b/works/solutions/leetcode/cpp/766-2.cpp new file mode 100644 index 0000000..79a0cc8 --- /dev/null +++ b/works/solutions/leetcode/cpp/766-2.cpp @@ -0,0 +1,20 @@ +#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();
+
+ for (int i = 1; i < row_count; i++) {
+ for (int j = 1; j < col_count; j++) {
+ if (matrix[i][j] != matrix[i - 1][j - 1])
+ return false;
+ }
+ }
+
+ return true;
+ }
+};
\ No newline at end of file |