leetcode 2/14/2014

daiwb · daiwb · commit 1c54142c6492 · 2014-02-14T16:02:45.000-08:00
diff --git a/LeetCode/grayCode.cpp b/LeetCode/grayCode.cpp
@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define REP(i,n) for(int i=0;i<(n);++i)
+#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
+#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
+
+class Solution {
+public:
+    vector<int> grayCode(int n) {
+        int num = (1 << n);
+        vector<int> ret;
+        REP(i,num) {
+            ret.push_back(i ^ (i >> 1));
+        }
+        return ret;
+    }
+};
+
+int main() {
+    return 0;
+}
diff --git a/LeetCode/isValidSudoku.cpp b/LeetCode/isValidSudoku.cpp
@@ -0,0 +1,50 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define REP(i,n) for(int i=0;i<(n);++i)
+#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
+#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
+
+class Solution {
+public:
+    bool isValidSudoku(vector<vector<char> > &board) {
+        REP(i,9) {
+            vector<int> r(10, 0), c(10, 0);
+            REP(j,9) {
+                if (board[i][j] != '.') {
+                    int num = board[i][j] - '0';
+                    if (r[num] == 1) return false;
+                    r[num] = 1;
+                }
+                if (board[j][i] != '.') {
+                    int num = board[j][i] - '0';
+                    if (c[num] == 1) return false;
+                    c[num] = 1;
+                }
+            }
+        }
+
+        for (int rr = 0; rr < 9; rr += 3) {
+            for (int cc = 0; cc < 9; cc += 3) {
+                vector<int> m(10, 0);
+                REP(i,3) {
+                    REP(j,3) {
+                        if (board[rr + i][cc + j] != '.') {
+                            int num = board[rr + i][cc + j] - '0';
+                            if (m[num] == 1) return false;
+                            m[num] = 1;
+                        }
+                    }
+                }
+            }
+        }
+
+        return true;
+    }
+};
+
+int main() {
+    return 0;
+}
diff --git a/LeetCode/searchRange.cpp b/LeetCode/searchRange.cpp
@@ -0,0 +1,55 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+using namespace std;
+
+#define REP(i,n) for(int i=0;i<(n);++i)
+#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
+#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
+
+class Solution {
+public:
+    vector<int> searchRange(int A[], int n, int target) {
+        vector<int> ret;
+        int l = 0, r = n - 1;
+        while (l <= r) {
+            int m = (l + r) / 2;
+            if (target <= A[m]) r = m - 1;
+            else l = m + 1;
+        }
+        if (n == 0 || r + 1 >= n || A[r + 1] != target) {
+            ret.push_back(-1);
+            ret.push_back(-1);
+            return ret;
+        }
+        ret.push_back(r + 1);
+
+        l = 0, r = n - 1;
+        while (l <= r) {
+            int m = (l + r) / 2;
+            if (target >= A[m]) l = m + 1;
+            else r = m - 1;
+        }
+        ret.push_back(l - 1);
+        return ret;
+    }
+};
+
+void test(int mm[], int len, int target) {
+    Solution s;
+    vector<int> ret = s.searchRange(mm, len, target);
+    cout << ret[0] << " " << ret[1] << endl;
+}
+
+int main() {
+    int mm1[] = {5, 7, 7, 8, 8, 10};
+    test(mm1, sizeof(mm1) / sizeof(mm1[0]), 8);
+    test(mm1, sizeof(mm1) / sizeof(mm1[0]), 4);
+    test(mm1, sizeof(mm1) / sizeof(mm1[0]), 11);
+    test(mm1, sizeof(mm1) / sizeof(mm1[0]), 6);
+
+    int mm2[] = {};
+    test(mm2, sizeof(mm2) / sizeof(mm2[0]), 8);
+
+    return 0;
+}
