6 problems solved.

lintcoder · lintcoder · commit e5650c7f69f1 · 2020-02-29T11:39:37.000+08:00
diff --git a/src/1037.cpp b/src/1037.cpp
@@ -0,0 +1,11 @@
+bool isBoomerang(vector<vector<int>>& points) {
+        if (points[0] == points[1] || points[0] == points[2] || points[1] == points[2])
+            return false;
+        if (points[0][0] == points[1][0])
+            return points[0][0] != points[2][0];
+        else if (points[0][1] == points[1][1])
+            return points[0][1] != points[2][1];
+        else
+            return (points[1][1]-points[0][1])*(points[2][0]-points[1][0]) !=
+            (points[2][1]-points[1][1])*(points[1][0]-points[0][0]);
+    }
diff --git a/src/1128.cpp b/src/1128.cpp
@@ -0,0 +1,28 @@
+int numEquivDominoPairs(vector<vector<int>>& dominoes) {
+        int len = dominoes.size();
+        if (len == 1)
+            return 0;
+        vector<vector<int>> vec(9, vector<int>(9, 0));
+        for (int i = 0; i < len; ++i)
+        {
+            int r = dominoes[i][0];
+            int c = dominoes[i][1];
+            if (r > c)
+            {
+                int t = r;
+                r = c;
+                c = t;
+            }
+            vec[r-1][c-1]++;
+        }
+        
+        int res = 0;
+        for (int i = 0; i < 9; ++i)
+        {
+            for (int j = i; j < 9; ++j)
+                if (vec[i][j] != 0)
+                    res += vec[i][j]*(vec[i][j]-1)/2;
+        }
+        
+        return res;
+    }
diff --git a/src/1154.cpp b/src/1154.cpp
@@ -0,0 +1,19 @@
+int dayOfYear(string date) {
+        int days[12] = {31,28,31,30,31,30,31,31,30,31,30,31};
+        
+        int num = 0;
+        if (date[5] == '0')
+            num = date[6]-'0'-1;
+        else
+            num = date[6]-'0'+9;
+        int ct = 0;
+        for (int i = 0; i < num; ++i)
+            ct += days[i];
+        ct += (date[8]-'0')*10 + (date[9]-'0');
+        
+        int year = atoi(date.substr(0,4).c_str());
+        if (num >= 2 && ((year%4 == 0 && year%100 != 0) || year%400 == 0))
+            ++ct;
+        
+        return ct;
+    }
diff --git a/src/1184.cpp b/src/1184.cpp
@@ -0,0 +1,22 @@
+int distanceBetweenBusStops(vector<int>& distance, int start, int destination) {
+        int len = distance.size();
+        if (len == 1 || start == destination)
+            return 0;
+        if (start > destination)
+        {
+            int t = start;
+            start = destination;
+            destination = t;
+        }
+        
+        int dist = 0, sum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            sum += distance[i];
+            if (i >= start && i < destination)
+                dist += distance[i];
+        }
+        
+        sum -= dist;
+        return dist < sum ? dist : sum;
+    }
diff --git a/src/1232.cpp b/src/1232.cpp
@@ -0,0 +1,35 @@
+bool checkStraightLine(vector<vector<int>>& coordinates) {
+        int len = coordinates.size();
+        if (len == 2)
+            return true;
+        
+        int dx = coordinates[1][0]-coordinates[0][0], dy = coordinates[1][1]-coordinates[0][1];
+        if (dx == 0)
+        {
+            for (int i = 2; i < len; ++i)
+                if (coordinates[i][0] != coordinates[0][0])
+                    return false;
+            return true;
+        }
+        else if (dy == 0)
+        {
+            for (int i = 2; i < len; ++i)
+                if (coordinates[i][1] != coordinates[0][1])
+                    return false;
+            return true;
+        }
+        else
+        {
+            for (int i = 2; i < len; ++i)
+            {
+                int dy1 = coordinates[1][1]-coordinates[0][1];
+                int dx2 = coordinates[i][0]-coordinates[1][0];
+                int dy2 = coordinates[i][1]-coordinates[1][1];
+                int dx1 = coordinates[1][0]-coordinates[0][0];
+                if (dy1*dx2 != dy2*dx1)
+                    return false;
+            }
+            
+            return true;
+        }
+    }
diff --git a/src/594.cpp b/src/594.cpp
@@ -0,0 +1,69 @@
+int findLHS(vector<int>& nums) {
+        int len = nums.size();
+        if (len <= 1)
+            return 0;
+        
+        sort(nums.begin(), nums.end());
+        int a = nums[0], b = nums[1];
+        int maxlen = 0;
+        int sublen = (b-a == 1) ? 2 : 0;
+        int i = 2;
+        int p = -1, q = -1;
+        if (sublen == 2)
+        {
+            p = 0;
+            q = 1;
+        }
+        while (i < len)
+        {
+            if (sublen != 0)
+            {
+                if (nums[i] == nums[i-1])
+                {
+                    ++sublen;
+                    q = i;
+                }
+                else
+                {
+                    if (nums[i]-nums[i-1] == 1)
+                    {
+                        int j = i-1;
+                        while (j >= 0 && nums[j] == nums[i-1])
+                            --j;
+                        p = j+1;
+                        q = i;
+                        if (sublen > maxlen)
+                            maxlen = sublen;
+                        sublen = i-j;
+                    }
+                    else
+                    {
+                        p = -1;
+                        q = -1;
+                        if (sublen > maxlen)
+                            maxlen = sublen;
+                        sublen = 0;
+                    }
+                }
+            }
+            else
+            {
+                if (nums[i]-nums[i-1] == 1)
+                {
+                    int j = i-1;
+                    while (j >= 0 && nums[j] == nums[i-1])
+                        --j;
+                    p = j+1;
+                    q = i;
+                    if (sublen > maxlen)
+                        maxlen = sublen;
+                    sublen = i-j; 
+                }
+            }
+            ++i;
+        }
+        
+        if (sublen > maxlen)
+            maxlen = sublen;
+        return maxlen;
+    }
