5 problems solved.

lintcoder · lintcoder · commit de6b81ff1d1e · 2022-05-01T10:09:49.000+08:00
diff --git a/src/120.cpp b/src/120.cpp
@@ -0,0 +1,12 @@
+int minimumTotal(vector<vector<int>>& triangle) {
+        int len = triangle.size();
+        for (int i = len-2; i >= 0; --i)
+        {
+            for (int j = 0; j < i+1; ++j)
+            {
+                triangle[i][j] = triangle[i+1][j]<triangle[i+1][j+1] ? triangle[i][j]+triangle[i+1][j] : triangle[i][j]+triangle[i+1][j+1];
+            }
+        }
+        
+        return triangle[0][0];
+    }
diff --git a/src/1974.cpp b/src/1974.cpp
@@ -0,0 +1,13 @@
+int minTimeToType(string word) {
+        int len = word.size();
+        int cur = 'a';
+        int ct = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int tmp = abs(word[i]-cur);
+            ct += tmp < 26-tmp ? tmp : 26-tmp;
+            cur = word[i];
+        }
+        
+        return ct + len;
+    }
diff --git a/src/2231.cpp b/src/2231.cpp
@@ -0,0 +1,34 @@
+int largestInteger(int num) {
+        string s = to_string(num);
+        int len = s.size();
+        int odd[10] = {0};
+        int even[10] = {0};
+        int nodd = 0, neven = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if ((s[i]-'0')%2 == 0)
+                even[neven++] = i;
+            else
+                odd[nodd++] = i;
+        }
+        
+        for (int i = 0; i < len; ++i)
+        {
+            if ((s[i]-'0')%2 == 0)
+            {
+                for (int j = 0; j < neven; ++j)
+                {
+                    if (i < even[j] && s[i] < s[even[j]])
+                        swap(s[i], s[even[j]]);
+                }
+            }
+            else
+            {
+                for (int j = 0; j < nodd; ++j)
+                    if (i < odd[j] && s[i] < s[odd[j]])
+                        swap(s[i], s[odd[j]]);
+            }
+        }
+        
+        return stoi(s);
+    }
diff --git a/src/2248.cpp b/src/2248.cpp
@@ -0,0 +1,21 @@
+vector<int> intersection(vector<vector<int>>& nums) {
+        int len = nums.size();
+        int arr[1001] = {0};
+        for (int i = 0; i < len; ++i)
+        {
+            int sz = nums[i].size();
+            for (int j = 0; j < sz; ++j)
+                ++arr[nums[i][j]];
+        }
+        
+        vector<int> res(1000, 0);
+        int k = 0;
+        for (int i = 0; i < 1001; ++i)
+        {
+            if (arr[i] == len)
+                res[k++] = i;
+        }
+        
+        
+        return vector<int>(res.begin(), res.begin()+k);
+    }
diff --git a/src/2255.cpp b/src/2255.cpp
@@ -0,0 +1,21 @@
+int countPrefixes(vector<string>& words, string s) {
+        int len = words.size();
+        int lens = s.size();
+        int ct = 0, j;
+        for (int i = 0; i < len; ++i)
+        {
+            int sz = words[i].size();
+            if (sz <= lens)
+            {
+                for (j = 0; j < sz; ++j)
+                {
+                    if (words[i][j] != s[j])
+                        break;
+                }
+                if(j == sz)
+                    ++ct;
+            }
+        }
+        
+        return ct;
+    }
