7 problems solved.

lintcoder · lintcoder · commit bbae6de0c61f · 2022-11-13T20:23:03.000+08:00
diff --git a/src/2441.cpp b/src/2441.cpp
@@ -0,0 +1,17 @@
+int findMaxK(vector<int>& nums) {
+        int len = nums.size();
+        sort(nums.begin(), nums.end());
+        
+        int i = 0, j = len-1;
+        while (i < j)
+        {
+            if (nums[i] == -nums[j])
+                return nums[j];
+            else if (-nums[i] < nums[j])
+                --j;
+            else
+                ++i;
+        }
+        
+        return -1;
+    }
diff --git a/src/2446.cpp b/src/2446.cpp
@@ -0,0 +1,3 @@
+bool haveConflict(vector<string>& event1, vector<string>& event2) {
+        return !((event2[0] > event1[1]) || (event2[1] < event1[0]));
+    }
diff --git a/src/2451.cpp b/src/2451.cpp
@@ -0,0 +1,63 @@
+string oddString(vector<string>& words) {
+        int len = words.size();
+        int n = words[0].size();
+        int i = 0;
+        
+        vector<vector<int>> diffarr(2, vector<int>(n, 0));
+        for (i = 0; i < 2; ++i)
+        {
+            for (int j = 1; j < n; ++j)
+            {
+                diffarr[i][j-1] = (int)words[i][j] - (int)words[i][j-1];
+            }
+        }
+        
+        bool flag = false;
+        int pos = 0;
+        for (i = 0; i < n-1; ++i)
+        {
+            if (diffarr[0][i] != diffarr[1][i])
+            {
+                flag = true;
+                break;
+            }
+        }
+        
+        if (flag)
+        {
+            for (int j = 1; j < n; ++j)
+            {
+                int tmp = (int)words[2][j] - (int)words[2][j-1];
+                if (tmp != diffarr[0][j-1])
+                {
+                    pos = 0;
+                    break;
+                }
+                if (tmp != diffarr[1][j-1])
+                {
+                    pos = 1;
+                    break;
+                }
+            }
+            
+            return words[pos];
+        }
+        else
+        {
+            for (i = 2; i < len; ++i)
+            {
+                for (int j = 1; j < n; ++j)
+                {
+                    int tmp = (int)words[i][j] - (int)words[i][j-1];
+                    if (tmp != diffarr[0][j-1])
+                    {
+                        pos = i;
+                        i = len;
+                        break;
+                    }
+                }
+            }
+            
+            return words[pos];
+        }
+    }
diff --git a/src/2455.cpp b/src/2455.cpp
@@ -0,0 +1,17 @@
+int averageValue(vector<int>& nums) {
+        int len = nums.size();
+        int ct = 0, sum = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (nums[i]%6 == 0)
+            {
+                sum += nums[i];
+                ++ct;
+            }
+        }
+        
+        if (ct != 0)
+            return sum/ct;
+        else
+            return 0;
+    }
diff --git a/src/2456.cpp b/src/2456.cpp
@@ -0,0 +1,36 @@
+vector<vector<string>> mostPopularCreator(vector<string>& creators, vector<string>& ids, vector<int>& views) {
+        int len = creators.size();
+        map<string, tuple<long long, int, string>> mp;
+        
+        long long maxview = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (views[i] > get<1>(mp[creators[i]]))
+            {
+                get<1>(mp[creators[i]]) = views[i];
+                get<2>(mp[creators[i]]) = ids[i];
+            }
+            else if (views[i] == get<1>(mp[creators[i]]))
+            {
+                if (get<2>(mp[creators[i]]) == "")
+                    get<2>(mp[creators[i]]) = ids[i];
+                else if (ids[i] < get<2>(mp[creators[i]]))
+                    get<2>(mp[creators[i]]) = ids[i];
+                
+            }
+            get<0>(mp[creators[i]]) += views[i];
+            if (get<0>(mp[creators[i]]) > maxview)
+                maxview = get<0>(mp[creators[i]]);
+        }
+        
+        vector<vector<string>> res;
+        for (auto iter = mp.begin(); iter != mp.end(); ++iter)
+        {
+            if (get<0>(iter->second) == maxview)
+            {
+                res.push_back({iter->first, get<2>(iter->second)});
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/2460.cpp b/src/2460.cpp
@@ -0,0 +1,23 @@
+vector<int> applyOperations(vector<int>& nums) {
+        int len = nums.size();
+        int i = 0;
+        while (i < len-1)
+        {
+            if (nums[i] == nums[i+1])
+            {
+                nums[i] *= 2;
+                nums[i+1] = 0;
+            }
+            ++i;
+        }
+        
+        i = 0;
+        vector<int> res(len, 0);
+        for (int j = 0; j < len; ++j)
+        {
+            if(nums[j] != 0)
+                res[i++] = nums[j];
+        }
+        
+        return res;
+    }
diff --git a/src/2469.cpp b/src/2469.cpp
@@ -0,0 +1,3 @@
+vector<double> convertTemperature(double celsius) {
+        return {celsius+273.15, celsius*1.8+32};
+    }

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+bool haveConflict(vector<string>& event1, vector<string>& event2) {`
	`2`	`+ return !((event2[0] > event1[1]) \|\| (event2[1] < event1[0]));`
	`3`	`+ }`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+vector<double> convertTemperature(double celsius) {`
	`2`	`+ return {celsius+273.15, celsius*1.8+32};`
	`3`	`+ }`