4 problems solved.

lintcoder · lintcoder · commit 7d1ff607bce9 · 2020-03-07T19:34:07.000+08:00
diff --git a/src/1360.cpp b/src/1360.cpp
@@ -0,0 +1,41 @@
+int daysBetweenDates(string date1, string date2) {
+        
+        int mdays[12] = {31,28,31,30,31,30,
+                        31,31,30,31,30,31};
+        int year1 = atoi(date1.substr(0, 4).c_str());
+        int year2 = atoi(date2.substr(0, 4).c_str());
+        int month1 = (date1[5]-'0')*10 + (date1[6]-'0');
+        int month2 = (date2[5]-'0')*10 + (date2[6]-'0');
+        int day1 = (date1[8]-'0')*10 + (date1[9]-'0');
+        int day2 = (date2[8]-'0')*10 + (date2[9]-'0');
+        
+        int interval1 = 0, interval2 = 0;
+        for (int i = 1971; i < year1; ++i)
+            interval1 += (i-1972)%4 != 0 ? 365 : 366;
+        for (int i = 1971; i < year2; ++i)
+            interval2 += (i-1972)%4 != 0 ? 365 : 366;
+        
+        for (int i = 1; i < month1; ++i)
+        {
+            interval1 += mdays[i-1];
+            if (i == 2)
+            {
+                if ((year1-1972)%4 == 0 && year1 != 2100)
+                    interval1 += 1;
+            }
+        }
+
+        for (int i = 1; i < month2; ++i)
+        {
+            interval2 += mdays[i-1];
+            if (i == 2)
+            {
+                if ((year2-1972)%4 == 0 && year2 != 2100)
+                    interval2 += 1;
+            }
+        }
+        interval1 += day1;
+        interval2 += day2;
+        
+        return abs(interval1-interval2);
+    }
diff --git a/src/1365.cpp b/src/1365.cpp
@@ -0,0 +1,20 @@
+vector<int> smallerNumbersThanCurrent(vector<int>& nums) {
+        int len = nums.size();
+        vector<int> ct(101);
+        vector<int> sum(101);
+        for (int i = 0; i < len; ++i)
+            ++ct[nums[i]];
+        
+        int subsum = 0;
+        for (int i = 1; i < 101; ++i)
+        {
+            subsum += ct[i-1];
+            sum[i] = subsum;
+        }
+        
+        vector<int> res(len);
+        for (int i = 0; i < len; ++i)
+            res[i] = sum[nums[i]];
+        
+        return res;
+    }
diff --git a/src/532.cpp b/src/532.cpp
@@ -0,0 +1,29 @@
+int findPairs(vector<int>& nums, int k) {
+        sort(nums.begin(), nums.end());
+        int len = nums.size();
+        if (len <= 1)
+            return 0;
+        if (len == 2)
+            return nums[1]-nums[0] == k ? 1 : 0;
+        int i = 0;
+        int j = 1;
+        int ct = 0;
+        while (i < len-1 && j < len)
+        {
+            int t = nums[j] - nums[i];
+            if (t < k)
+                ++j;
+            else
+            {
+                if (t == k)
+                    ++ct;
+                int n = i+1;
+                while (n < len && nums[n] == nums[i])
+                    ++n;
+                i = n;
+                j = i+1;
+            }
+        }
+        
+        return ct;
+    }
diff --git a/src/970.cpp b/src/970.cpp
@@ -0,0 +1,38 @@
+vector<int> powerfulIntegers(int x, int y, int bound) {
+        if (bound <= 1)
+            return {};
+        if (bound == 2)
+            return {2};
+        if (x == 1 && y == 1)
+            return {2};
+        if (x == 1 || y == 1)
+        {
+            int t = x != 1 ? x : y;
+            int x = 1;
+            int sz = log(bound-1)/log(t)+1;
+            vector<int> res(sz);
+            for (int i = 0; i < sz; ++i)
+            {
+                res[i] = 1+x;
+                x *= t;
+            }
+            return res;
+        }
+        
+        int m = log(bound)/log(x);
+        int n = log(bound)/log(y);
+        set<int> st;
+        for (int i = 0; i <= m; ++i)
+        {
+            for (int j = 0; j <= n; ++j)
+            {
+                double t = pow(x, i) + pow(y, j);
+                if (t <= bound)
+                    st.insert(t);
+            }
+        }
+        
+        vector<int> res;
+        res.assign(st.begin(), st.end());
+        return res;
+    }
