7 problems solved.

lintcoder · lintcoder · commit 22291efd7091 · 2021-01-30T19:35:26.000+08:00
diff --git a/src/1437.cpp b/src/1437.cpp
@@ -0,0 +1,29 @@
+bool kLengthApart(vector<int>& nums, int k) {
+        int len = nums.size();
+        int i = 0;
+        while (i < len && nums[i] == 0)
+            ++i;
+        if (i == len)
+            return true;
+        
+        int j = i+1;
+        int n = 0;
+        while (j < len)
+        {
+            if (nums[j] == 0)
+                ++n;
+            else
+            {
+                if (n < k)
+                    return false;
+                else
+                {
+                    n = 0;
+                    i = j;
+                }
+            }
+            ++j;
+        }
+        
+        return true;
+    }
diff --git a/src/1576.cpp b/src/1576.cpp
@@ -0,0 +1,32 @@
+string modifyString(string s) {
+        int len = s.size();
+        int i = 0;
+        if (s[i] == '?')
+        {
+            if (i+1 < len && s[i+1] != '?')
+                s[i] = s[i+1] < 'z' ? s[i+1]+1 : 'a';
+            else
+                s[i] = 'a';
+        }
+        ++i;
+        
+        while (i < len)
+        {
+            if (s[i] == '?')
+            {
+                if (i+1 < len && s[i+1] != '?')
+                {
+                    char c = s[i-1] < s[i+1] ? s[i-1] : s[i+1];
+                    if (c == 'z')
+                        s[i] = 'a';
+                    else
+                        s[i] = c+1 != s[i-1]+s[i+1]-c ? c+1 : (c+1 < 'z' ? c+2 : 'a');
+                }
+                else
+                    s[i] = s[i-1] < 'z' ? s[i-1]+1 : 'a';
+            }
+            ++i;
+        }
+        
+        return s;
+    }
diff --git a/src/1608.cpp b/src/1608.cpp
@@ -0,0 +1,34 @@
+int specialArray(vector<int>& nums) {
+        int len = nums.size();
+        sort(nums.begin(), nums.end());
+        map<int, int> mp;
+        int k = nums[len-1];
+        mp[k] = 1;
+        for (int i = len-2; i >= 0; --i)
+        {
+            if (nums[i] == k)
+            {
+                mp[k]++;
+            }
+            else
+            {
+                mp[nums[i]] = mp[k] + 1;
+                k = nums[i];
+            }
+        }
+        
+        int n = mp.begin()->first;
+        for (auto iter = mp.begin(); iter != mp.end(); ++iter)
+        {
+            if (iter->first == iter->second)
+                return iter->first;
+            else if (iter->first > iter->second)
+            {
+                if (iter == mp.begin() || iter->second > n)
+                    return iter->second;
+            }
+            n = iter->first;
+        }
+        
+        return -1;
+    }
diff --git a/src/1629.cpp b/src/1629.cpp
@@ -0,0 +1,21 @@
+char slowestKey(vector<int>& releaseTimes, string keysPressed) {
+        int len = releaseTimes.size();
+        int maxtime = releaseTimes[0];
+        char c = keysPressed[0];
+        for (int i = 1; i < len; ++i)
+        {
+            int duration = releaseTimes[i] - releaseTimes[i-1];
+            if (duration > maxtime)
+            {
+                maxtime = duration;
+                c = keysPressed[i];
+            }
+            else if (duration == maxtime)
+            {
+                if (keysPressed[i] > c)
+                    c = keysPressed[i];
+            }
+        }
+        
+        return c;
+    }
diff --git a/src/1646.cpp b/src/1646.cpp
@@ -0,0 +1,22 @@
+int getMaximumGenerated(int n) {
+        if (n <= 1)
+            return n;
+        
+        vector<int> vec(n+1, 0);
+        vec[0] = 0;
+        vec[1] = 1;
+        int i = 2;
+        int maxvalue = 1;
+        while (i <= n)
+        {
+            if (i%2 == 0)
+                vec[i] = vec[i/2];
+            else
+                vec[i] = vec[i/2] + vec[i/2+1];
+            if (vec[i] > maxvalue)
+                maxvalue = vec[i];
+            ++i;
+        }
+        
+        return maxvalue;
+    }
diff --git a/src/1710.cpp b/src/1710.cpp
@@ -0,0 +1,21 @@
+int maximumUnits(vector<vector<int>>& boxTypes, int truckSize) {
+        int len = boxTypes.size();
+        auto cmp = [&boxTypes](const vector<int>& a, const vector<int>& b) {
+            return a[1] > b[1] || (a[1]==b[1] && a[0] > b[0]);
+        };
+        
+        sort(boxTypes.begin(), boxTypes.end(), cmp);
+        
+        int i = truckSize;
+        int j = 0;
+        int sum = 0;
+        while (i > 0 && j < len)
+        {
+            int n = boxTypes[j][0] <= i ? boxTypes[j][0] : i;
+            sum += n*boxTypes[j][1];
+            i -= n;
+            ++j;
+        }
+        
+        return sum;
+    }
diff --git a/src/1716.cpp b/src/1716.cpp
@@ -0,0 +1,7 @@
+int totalMoney(int n) {
+        int p = n/7;
+        int r = n%7;
+        int sum = 28*p + p*(p-1)*7/2;
+        
+        return sum + ((p+1)+(p+r))*r/2;
+    }
