aboutsummaryrefslogtreecommitdiff
path: root/check_every_row_col_contain_num.c
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-09-12 22:36:22 -0600
committerJack Sangdahl <[email protected]>2025-09-12 22:36:22 -0600
commit77d6e1dd41c644ed28fb61a3f19614965b43908c (patch)
treedd3bd4f8d3ad9df7a2f0a8728f40d80e09e98184 /check_every_row_col_contain_num.c
parente648ecc896f5ac7db93b046699adf1832e74405f (diff)
downloadleetcode-77d6e1dd41c644ed28fb61a3f19614965b43908c.tar.gz
leetcode-77d6e1dd41c644ed28fb61a3f19614965b43908c.zip
2133. check if every row and column contains all numbers
Diffstat (limited to 'check_every_row_col_contain_num.c')
-rw-r--r--check_every_row_col_contain_num.c35
1 files changed, 35 insertions, 0 deletions
diff --git a/check_every_row_col_contain_num.c b/check_every_row_col_contain_num.c
new file mode 100644
index 0000000..9f79f34
--- /dev/null
+++ b/check_every_row_col_contain_num.c
@@ -0,0 +1,35 @@
+// 2133. Check if Every Row and Column Contains All Numbers
+#include "leetcode.h"
+
+/*
+ * an 'n x n' matrix is valid if every row and every column contains all the
+ * integers from 1 to 'n'. given an 'n x n' matrix, return true if the matrix is
+ * valid, otherwise return false.
+ */
+
+bool checkValid(int **matrix, int matrixSize, int *matrixColSize) {
+ for (int i = 0; i < matrixSize; i++) {
+ int row = 1, col = 1, mask = 1;
+ for (int j = 0; j < matrixSize; j++) {
+ row ^= 1 << matrix[i][j];
+ col ^= 1 << matrix[j][i];
+ mask |= 1 << (j + 1);
+ }
+ if (row ^ mask || col ^ mask)
+ return false;
+ }
+ return true;
+}
+
+int main() {
+ int m1i[3][3] = {{1, 2, 3}, {3, 1, 2}, {2, 3, 1}},
+ m2i[3][3] = {{1, 1, 1}, {1, 2, 3}, {1, 2, 3}};
+ struct two_d_arr *m1 =
+ two_d_arr_init(ARRAY_SIZE(m1i), ARRAY_SIZE(m1i[0]), m1i);
+ struct two_d_arr *m2 =
+ two_d_arr_init(ARRAY_SIZE(m2i), ARRAY_SIZE(m2i[0]), m2i);
+ printf("%d\n", checkValid(m1->arr, m1->row_size, m1->col_size)); // expect: 1
+ printf("%d\n", checkValid(m2->arr, m2->row_size, m2->col_size)); // expect: 0
+ two_d_arr_free(m1);
+ two_d_arr_free(m2);
+}