8 problems solved.

lintcoder · lintcoder · commit 8bf1af49204c · 2020-10-08T19:16:27.000+08:00
diff --git a/src/1470.cpp b/src/1470.cpp
@@ -0,0 +1,12 @@
+vector<int> shuffle(vector<int>& nums, int n) {
+        vector<int> res(n*2);
+        int j = 0;
+        for (int i = 0; i < n; ++i)
+        {
+            res[j] = nums[i];
+            res[j+1] = nums[i+n];
+            j += 2;
+        }
+        
+        return res;
+    }
diff --git a/src/1491.cpp b/src/1491.cpp
@@ -0,0 +1,17 @@
+double average(vector<int>& salary) {
+        int len = salary.size();
+        int minval = 1e6, maxval = 0;
+        double sum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            sum += salary[i];
+            if (salary[i] < minval)
+                minval = salary[i];
+            if (salary[i] > maxval)
+                maxval = salary[i];
+        }
+        
+        sum -= (minval+maxval);
+        
+        return sum/(len-2);
+    }
diff --git a/src/1502.cpp b/src/1502.cpp
@@ -0,0 +1,12 @@
+bool canMakeArithmeticProgression(vector<int>& arr) {
+        int len = arr.size();
+        sort(arr.begin(), arr.end());
+        int diff = arr[1]-arr[0];
+        for (int i = 2; i < len; ++i)
+        {
+            if (arr[i]-arr[i-1] != diff)
+                return false;
+        }
+        
+        return true;
+    }
diff --git a/src/1528.cpp b/src/1528.cpp
@@ -0,0 +1,8 @@
+string restoreString(string s, vector<int>& indices) {
+        int n = s.size();
+        string res(n,' ');
+        for (int i= 0; i < n; ++i)
+            res[indices[i]] = s[i];
+        
+        return res;
+    }
diff --git a/src/1534.cpp b/src/1534.cpp
@@ -0,0 +1,21 @@
+int countGoodTriplets(vector<int>& arr, int a, int b, int c) {
+        int len = arr.size();
+        int ct = 0;
+        for (int i = 0; i < len-2; ++i)
+        {
+            for (int j = i+1; j < len-1; ++j)
+            {
+                if (abs(arr[i]-arr[j]) <= a)
+                {
+                    for (int k = j+1; k < len; ++k)
+                    {
+                        if (abs(arr[j]-arr[k]) <= b && abs(arr[i]-arr[k]) <= c)
+                            ++ct;
+                    }
+                }
+            }
+        }
+         
+        
+        return ct;
+    }
diff --git a/src/1550.cpp b/src/1550.cpp
@@ -0,0 +1,12 @@
+bool threeConsecutiveOdds(vector<int>& arr) {
+        int len = arr.size();
+        for (int i = 0; i < len-2; ++i)
+        {
+            if (arr[i]%2 == 1 && arr[i+1]%2 == 1 && arr[i+2]%2 == 1)
+            {
+                return true;
+            }
+        }
+        
+        return false;
+    }
diff --git a/src/1588.cpp b/src/1588.cpp
@@ -0,0 +1,21 @@
+int sumOddLengthSubarrays(vector<int>& arr) {
+        int len = arr.size();
+        int res = 0;
+        for (int i = 1; i <= len ; i += 2)
+        {
+            int tmp = 0;
+            for (int j = 0; j < i; ++j)
+                tmp += arr[j];
+            
+            res += tmp;
+            
+            for (int j = 0; j < len-i; ++j)
+            {
+                tmp -= arr[j];
+                tmp += arr[j+i];
+                res += tmp;
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/1603.cpp b/src/1603.cpp
@@ -0,0 +1,46 @@
+class ParkingSystem {
+public:
+    ParkingSystem(int big, int medium, int small) {
+        mbig = big;
+        mmedium = medium;
+        msmall = small;
+    }
+    
+    bool addCar(int carType) {
+        if (carType == 1)
+        {
+            if (mbig > 0)
+            {
+                --mbig;
+                return true;
+            }
+            else
+                return false;
+        }
+        else if (carType == 2)
+        {
+            if (mmedium > 0)
+            {
+                --mmedium;
+                return true;
+            }
+            else
+                return false;
+        }
+        else
+        {
+            if (msmall > 0)
+            {
+                --msmall;
+                return true;
+            }
+            else
+                return false;
+        }
+    }
+    
+private:
+    int mbig;
+    int mmedium;
+    int msmall;
+};
