leetcode 2/13/2014

daiwb · daiwb · commit 4949d1d5be09 · 2014-02-13T18:46:03.000-08:00
diff --git a/LeetCode/longestValidParentheses.cpp b/LeetCode/longestValidParentheses.cpp
@@ -0,0 +1,36 @@
+#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:
+    int longestValidParentheses(string s) {
+        int n = s.length();
+        if (n <= 1) return 0;
+        int ret = 0;
+        vector<int> mm(n, 0);
+        RFOR(i,n-2,0) {
+            if (s[i] == ')') continue;
+            int rt = i + mm[i + 1] + 1;
+            if (rt < n && s[rt] == ')') {
+                mm[i] = mm[i + 1] + 2;
+                if (++rt < n) mm[i] += mm[rt];
+            }
+            ret = max(ret, mm[i]);
+        }
+        return ret;
+    }
+};
+
+int main() {
+    Solution s;
+    cout << s.longestValidParentheses("(()") << endl;
+    cout << s.longestValidParentheses(")()())") << endl;
+    cout << s.longestValidParentheses("(((()(()") << endl;
+    return 0;
+}
diff --git a/LeetCode/nextPermutation.cpp b/LeetCode/nextPermutation.cpp
@@ -0,0 +1,56 @@
+#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:
+    void nextPermutation(vector<int> &num) {
+        int n = num.size();
+        int idx = n - 1;
+        while (idx - 1 >= 0 && num[idx - 1] >= num[idx]) --idx;
+        if (--idx <= -1) {
+            reverse(num.begin(), num.end());
+            return;
+        }
+
+        int lt = idx + 1, rt = n - 1;
+        while (lt <= rt) {
+            int mt = (lt + rt) / 2;
+            if (num[mt] <= num[idx]) {
+                rt = mt - 1;
+            } else {
+                lt = mt + 1;
+            }
+        }
+
+        swap(num[idx], num[rt]);
+        reverse(num.begin() + idx + 1, num.end());
+    }
+};
+
+void test(int mm[], int len) {
+    vector<int> num;
+    num.assign(mm, mm + len);
+    Solution s;
+    s.nextPermutation(num);
+    REP(i,num.size()) cout << num[i] << " ";
+    cout << endl;
+}
+
+int main() {
+    int mm1[3] = {1, 2, 3};
+    test(mm1, sizeof(mm1) / sizeof(mm1[0]));
+
+    int mm2[] = {3, 2, 1};
+    test(mm2, sizeof(mm2) / sizeof(mm2[0]));
+
+    int mm3[] = {1, 1, 5};
+    test(mm3, sizeof(mm3) / sizeof(mm3[0]));
+    
+    return 0;
+}
