482/559

Author: MaskRay

README.md

@@ -2,7 +2,7 @@
 
 [LeetCode solutions](http://maskray.me/blog/2014-06-29-leetcode-solutions) gives some thoughts on selected problems.
 
-Solved 454/495 problems.
+Solved 482/559 problems.
 
 ## Database
 
@@ -12,10 +12,39 @@ See [database.md](database.md)
 
 | # | Title | Solution |
 |---| ----- | -------- |
+|635|[Design Log Storage System](https://leetcode.com/problems/design-log-storage-system)|[design-log-storage-system.cc](design-log-storage-system.cc)|
+|634|[Find the Derangement of An Array](https://leetcode.com/problems/find-the-derangement-of-an-array)|[find-the-derangement-of-an-array.cc](find-the-derangement-of-an-array.cc)|
+|633|[Sum of Square Numbers](https://leetcode.com/problems/sum-of-square-numbers)|[sum-of-square-numbers.cc](sum-of-square-numbers.cc)|
+|631|[Design Excel Sum Formula](https://leetcode.com/problems/design-excel-sum-formula)|[design-excel-sum-formula.cc](design-excel-sum-formula.cc)|
+|630|[Course Schedule III](https://leetcode.com/problems/course-schedule-iii)|[course-schedule-iii.cc](course-schedule-iii.cc)|
+|629|[K Inverse Pairs Array](https://leetcode.com/problems/k-inverse-pairs-array)|[k-inverse-pairs-array.cc](k-inverse-pairs-array.cc)|
+|628|[Maximum Product of Three Numbers](https://leetcode.com/problems/maximum-product-of-three-numbers)|[maximum-product-of-three-numbers.cc](maximum-product-of-three-numbers.cc)|
+|617|[Merge Two Binary Trees](https://leetcode.com/problems/merge-two-binary-trees)|[merge-two-binary-trees.cc](merge-two-binary-trees.cc)|
+|616|[Add Bold Tag in String](https://leetcode.com/problems/add-bold-tag-in-string)|[add-bold-tag-in-string.cc](add-bold-tag-in-string.cc)|
+|611|[Valid Triangle Number](https://leetcode.com/problems/valid-triangle-number)|[valid-triangle-number.cc](valid-triangle-number.cc)|
+|604|[Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator)|[design-compressed-string-iterator.cc](design-compressed-string-iterator.cc)|
+|600|[Non-negative Integers without Consecutive Ones](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones)|[non-negative-integers-without-consecutive-ones.cc](non-negative-integers-without-consecutive-ones.cc)|
+|599|[Minimum Index Sum of Two Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists)|[minimum-index-sum-of-two-lists.cc](minimum-index-sum-of-two-lists.cc)|
+|598|[Range Addition II](https://leetcode.com/problems/range-addition-ii)|[range-addition-ii.cc](range-addition-ii.cc)|
+|594|[Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence)|[longest-harmonious-subsequence.cc](longest-harmonious-subsequence.cc)|
+|593|[Valid Square](https://leetcode.com/problems/valid-square)|[valid-square.cc](valid-square.cc)|
+|592|[Fraction Addition and Subtraction](https://leetcode.com/problems/fraction-addition-and-subtraction)|[fraction-addition-and-subtraction.cc](fraction-addition-and-subtraction.cc)|
+|588|[Design In-Memory File System](https://leetcode.com/problems/design-in-memory-file-system)|[design-in-memory-file-system.cc](design-in-memory-file-system.cc)|
+|587|[Erect the Fence](https://leetcode.com/problems/erect-the-fence)|[erect-the-fence.cc](erect-the-fence.cc)|
+|583|[Delete Operation for Two Strings](https://leetcode.com/problems/delete-operation-for-two-strings)|[delete-operation-for-two-strings.cc](delete-operation-for-two-strings.cc)|
+|582|[Kill Process](https://leetcode.com/problems/kill-process)|[kill-process.cc](kill-process.cc)|
+|581|[Shortest Unsorted Continuous Subarray](https://leetcode.com/problems/shortest-unsorted-continuous-subarray)|[shortest-unsorted-continuous-subarray.cc](shortest-unsorted-continuous-subarray.cc)|
+|575|[Distribute Candies](https://leetcode.com/problems/distribute-candies)|[distribute-candies.cc](distribute-candies.cc)|
+|565|[Array Nesting](https://leetcode.com/problems/array-nesting)|[array-nesting.cc](array-nesting.cc)|
+|556|[Next Greater Element III](https://leetcode.com/problems/next-greater-element-iii)|[next-greater-element-iii.cc](next-greater-element-iii.cc)|
+|553|[Optimal Division](https://leetcode.com/problems/optimal-division)|[optimal-division.cc](optimal-division.cc)|
+|552|[Student Attendance Record II](https://leetcode.com/problems/student-attendance-record-ii)|[student-attendance-record-ii.cc](student-attendance-record-ii.cc)|
 |533|[Lonely Pixel II](https://leetcode.com/problems/lonely-pixel-ii)|[lonely-pixel-ii.cc](lonely-pixel-ii.cc)|
 |531|[Lonely Pixel I](https://leetcode.com/problems/lonely-pixel-i)|[lonely-pixel-i.cc](lonely-pixel-i.cc)|
 |514|[Freedom Trail](https://leetcode.com/problems/freedom-trail)|[freedom-trail.cc](freedom-trail.cc)|
 |508|[Most Frequent Subtree Sum](https://leetcode.com/problems/most-frequent-subtree-sum)|[most-frequent-subtree-sum.cc](most-frequent-subtree-sum.cc)|
+|507|[Perfect Number](https://leetcode.com/problems/perfect-number)|[perfect-number.cc](perfect-number.cc)|
+|504|[Base 7](https://leetcode.com/problems/base-7)|[base-7.cc](base-7.cc)|
 |502|[IPO](https://leetcode.com/problems/ipo)|[ipo.cc](ipo.cc)|
 |501|[Find Mode in Binary Search Tree](https://leetcode.com/problems/find-mode-in-binary-search-tree)|[find-mode-in-binary-search-tree.cc](find-mode-in-binary-search-tree.cc)|
 |500|[Keyboard Row](https://leetcode.com/problems/keyboard-row)|[keyboard-row.cc](keyboard-row.cc)|
@@ -417,7 +446,6 @@ See [database.md](database.md)
 |52|[N-Queens II](https://leetcode.com/problems/n-queens-ii)|[n-queens-ii.cc](n-queens-ii.cc)|
 |51|[N-Queens](https://leetcode.com/problems/n-queens)|[n-queens.cc](n-queens.cc)|
 |50|[Pow(x, n)](https://leetcode.com/problems/powx-n)|[powx-n.cc](powx-n.cc)|
-|49|[Group Anagrams](https://leetcode.com/problems/anagrams)|[anagrams.cc](anagrams.cc)|
 |48|[Rotate Image](https://leetcode.com/problems/rotate-image)|[rotate-image.cc](rotate-image.cc)|
 |47|[Permutations II](https://leetcode.com/problems/permutations-ii)|[permutations-ii.cc](permutations-ii.cc)|
 |46|[Permutations](https://leetcode.com/problems/permutations)|[permutations.cc](permutations.cc)|

add-bold-tag-in-string.cc

@@ -0,0 +1,33 @@
+// Add Bold Tag in String
+class Solution {
+public:
+  string addBoldTag(string s, vector<string>& dict) {
+    vector<int> a(s.size()+1);
+    for (auto t: dict) {
+      vector<int> pi(t.size());
+      for (int j = 0, i = 1; i < t.size(); i++) {
+        while (j && t[j] != t[i]) j = pi[j-1];
+        if (t[j] == t[i]) j++;
+        pi[i] = j;
+      }
+      for (int j = 0, i = 0; i < s.size(); i++) {
+        while (j && t[j] != s[i]) j = pi[j-1];
+        if (t[j] == s[i] && ++j == t.size()) {
+          a[i-t.size()+1]++;
+          a[i+1]--;
+          j = pi[j-1];
+        }
+      }
+    }
+    string r;
+    int c = 0, cc;
+    for (int i = 0; i <= s.size(); i++) {
+      cc = c+a[i];
+      if (! c && cc) r += "<b>";
+      else if (c && ! cc) r += "</b>";
+      if (i < n) r += s[i];
+      c = cc;
+    }
+    return r;
+  }
+};

array-nesting.cc

@@ -0,0 +1,23 @@
+// Array Nesting
+#define FOR(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (a); i < (b); i++)
+#define REP(i, n) FOR(i, 0, n)
+
+class Solution {
+public:
+  int arrayNesting(vector<int>& nums) {
+    int n = nums.size(), r = 0;
+    vector<int> v(n, 0);
+    REP(i, nums.size())
+      if (! v[i]) {
+        int c = 0;
+        for (int j = i; ; ) {
+          c++;
+          v[j] = 1;
+          j = nums[j];
+          if (j == i) break;
+        }
+        r = max(r, c);
+      }
+    return r;
+  }
+};

base-7.cc

@@ -0,0 +1,12 @@
+// Base 7
+class Solution {
+public:
+  string convertToBase7(int num) {
+    if (num < 0) return '-'+convertToBase7(-num);
+    string r;
+    do r.push_back(num%7+'0');
+    while (num /= 7);
+    reverse(r.begin(), r.end());
+    return r;
+  }
+};

codegolf/design-log-storage-system.cc

@@ -0,0 +1,13 @@
+struct LogSystem{
+  map<int,string>a;
+  void put(int i,string t){a[i]=t;}
+  vector<int>retrieve(string s,string e,string g){
+    int i=string("YMDHMS").find(g[0]);g[1]=='i'?i=4:0;
+    for(s=s.substr(0,4+3*i),e=e.substr(0,4+3*i);i++<5;s+=":00",e+=":99");
+    vector<int>r;
+    for(auto&x:a)
+      if(s<=(g=x.second)&&g<=e)
+        r.push_back(x.first);
+    return r;
+  }
+};

codegolf/find-the-derangement-of-an-array.cc

@@ -0,0 +1,8 @@
+struct Solution {
+  int findDerangement(int n) {
+    long s=0,i=2;
+    for(;i<=n;i++)
+      s=(i*s+1-i%2*2)%1000000007;
+    return s;
+  }
+};

course-schedule-iii.cc

@@ -0,0 +1,17 @@
+// Course Schedule III My SubmissionsBack To Contest
+class Solution {
+public:
+  int scheduleCourse(vector<vector<int>>& as) {
+    sort(as.begin(), as.end(), [](const vector<int>& x, const vector<int>& y) {
+      return x[1] < y[1];
+    });
+    priority_queue<int> q;
+    int s = 0;
+    for (auto &a: as) {
+      q.push(a[0]);
+      if ((s += a[0]) > a[1])
+        s -= q.top(), q.pop();
+    }
+    return q.size();
+  }
+};

delete-operation-for-two-strings.cc

@@ -0,0 +1,18 @@
+// Delete Operation for Two Strings
+#define FOR(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (a); i < (b); i++)
+#define REP(i, n) FOR(i, 0, n)
+
+class Solution {
+public:
+  int minDistance(string a, string b) {
+    int m = a.size(), n = b.size();
+    vector<vector<int>> s(2, vector<int>(n+1));
+    iota(s[0].begin(), s[0].end(), 0);
+    REP(i, m) {
+      s[i+1&1][0] = i+1;
+      REP(j, n)
+        s[i+1&1][j+1] = a[i] == b[j] ? s[i&1][j] : min(s[i+1&1][j], s[i&1][j+1])+1;
+    }
+    return s[m&1][n];
+  }
+};

design-compressed-string-iterator.cc

@@ -0,0 +1,26 @@
+// Design Compressed String Iterator
+class StringIterator {
+  string a;
+  size_t i = 0, c = 0;
+  char ch;
+public:
+  StringIterator(string a) {
+    this->a = a;
+  }
+
+  char next() {
+    if (c)
+      return c--, ch;
+    if (i >= a.size())
+      return ' ';
+    ch = a[i++];
+    while (i < a.size() && isdigit(a[i]))
+      c = c*10+a[i++]-'0';
+    c--;
+    return ch;
+  }
+
+  bool hasNext() {
+    return c || i < a.size();
+  }
+};

design-excel-sum-formula.cc

@@ -0,0 +1,63 @@
+// Design Excel Sum Formula
+#define FOR(i, a, b) for (remove_cv<remove_reference<decltype(b)>::type>::type i = (a); i < (b); i++)
+#define REP(i, n) FOR(i, 0, n)
+
+class Excel {
+  vector<vector<long>> a, c, d;
+  vector<vector<vector<tuple<int,int,int,int>>>> b;
+  long tick = 0;
+
+  pair<int, int> f(string x) {
+    return {atoi(x.c_str()+1)-1, x[0]-'A'};
+  }
+  long get_sum(const vector<tuple<int,int,int,int>>& xs, bool t = true) {
+    long sum = 0;
+    t && tick++;
+    for (auto& r: xs)
+      FOR(i, std::get<0>(r), std::get<2>(r))
+        FOR(j, std::get<1>(r), std::get<3>(r))
+          sum += get_cell(i, j);
+    return sum;
+  }
+  long get_cell(int x, int y) {
+    if (a[x][y] != LONG_MAX) return a[x][y];
+    if (d[x][y] == tick) return c[x][y];
+    d[x][y] = tick;
+    return c[x][y] = get_sum(b[x][y], false);
+  }
+public:
+  Excel(int H, char W) {
+    a = vector<vector<long>>(H, vector<long>(W-'A'+1));
+    b.resize(H);
+    REP(i, H) b[i].resize(W);
+    c = vector<vector<long>>(H, vector<long>(W-'A'+1));
+    d = vector<vector<long>>(H, vector<long>(W-'A'+1));
+  }
+
+  void set(int r, char c, int v) {
+    a[r-1][c-'A'] = v;
+  }
+
+  int get(int r, char c) {
+    tick++;
+    return get_cell(r-1, c-'A');
+  }
+
+  int sum(int r, char c, vector<string> strs) {
+    r--;
+    c -= 'A';
+    a[r][c] = LONG_MAX;
+    b[r][c].clear();
+    for (auto& s: strs) {
+      string::size_type g;
+      int x0, y0, x1, y1;
+      if ((g = s.find(':')) != string::npos) {
+        tie(x0, y0) = f(s.substr(0, g));
+        tie(x1, y1) = f(s.substr(g+1));
+      } else
+        tie(x0, y0) = tie(x1, y1) = f(s);
+      b[r][c].emplace_back(x0, y0, x1+1, y1+1);
+    }
+    return get_sum(b[r][c]);
+  }
+};