Weekly Contest 93

Author: MaskRay

advantage-shuffle.cc

@@ -0,0 +1,19 @@
+// Advantage Shuffle
+#define ALL(x) (x).begin(), (x).end()
+
+class Solution {
+public:
+  vector<int> advantageCount(vector<int>& A, vector<int>& B) {
+    int n = A.size();
+    vector<int> p(n), r(n);
+    iota(ALL(p), 0);
+    sort(ALL(p), [&](int x, int y) { return B[x] < B[y]; });
+    sort(ALL(A));
+    for (int i = n, j = n, k = 0, q = n; i--; ) {
+      while (j > k && A[j-1] > B[p[i]])
+        A[--q] = A[--j];
+      r[p[i]] = q < n ? A[q++] : A[k++];
+    }
+    return r;
+  }
+};

binary-gap.cc

@@ -0,0 +1,14 @@
+// Binary Gap
+class Solution {
+public:
+  int binaryGap(int N) {
+    int s = 0, j = -1;
+    for (int i = 0; i < 30; i++)
+      if (N>>i & 1) {
+        if (~j)
+          s = max(s, i - j);
+        j = i;
+      }
+    return s;
+  }
+};

minimum-number-of-refueling-stops.cc

@@ -0,0 +1,17 @@
+// Minimum Number of Refueling Stops
+class Solution {
+public:
+  int minRefuelStops(int target, int d, vector<vector<int>>& ss) {
+    int r = 0, i = 0, n = ss.size();
+    priority_queue<int> pq;
+    while (d < target) {
+      while (i < n && ss[i][0] <= d)
+        pq.push(ss[i++][1]);
+      if (pq.empty()) return -1;
+      d += pq.top();
+      pq.pop();
+      r++;
+    }
+    return r;
+  }
+};

reordered-power-of-2.cc

@@ -0,0 +1,17 @@
+// Reordered Power of 2
+class Solution {
+public:
+  bool reorderedPowerOf2(int N) {
+    int ten[10] = {}, ten1[10] = {};
+    do ten[N%10]++;
+    while (N /= 10);
+    for (int m = 1<<30; m; m >>= 1) {
+      copy_n(ten, 10, ten1);
+      int t = m;
+      do ten1[t%10]--;
+      while (t /= 10);
+      if (count(ten1, ten1+10, 0) == 10) return true;
+    }
+    return false;
+  }
+};