9 problems solved.

lintcoder · lintcoder · commit 7b965b8b1806 · 2021-01-01T16:32:45.000+08:00
diff --git a/src/1475.cpp b/src/1475.cpp
@@ -0,0 +1,17 @@
+vector<int> finalPrices(vector<int>& prices) {
+        int len = prices.size();
+        vector<int> res(prices.begin(), prices.end());
+        for (int i = 0; i < len-1; ++i)
+        {
+            for (int j = i+1; j < len; ++j)
+            {
+                if (prices[j] <= prices[i])
+                {
+                    res[i] = prices[i]-prices[j];
+                    break;
+                }
+            }
+        }
+        
+        return res;
+    }
diff --git a/src/1572.cpp b/src/1572.cpp
@@ -0,0 +1,10 @@
+int diagonalSum(vector<vector<int>>& mat) {
+        int row = mat.size();
+        int sum = 0;
+        for (int i = 0; i < row; ++i)
+            sum += mat[i][i] + mat[row-1-i][i];
+        
+        if (row%2 == 1)
+            sum -= mat[row/2][row/2];
+        return sum;
+    }
diff --git a/src/1662.cpp b/src/1662.cpp
@@ -0,0 +1,38 @@
+bool arrayStringsAreEqual(vector<string>& word1, vector<string>& word2) {
+        int i1 = 0, j1 = 0, i2 = 0, j2 = 0;
+        int len1 = word1.size();
+        int len2 = word2.size();
+        
+        int sz1 = word1[0].size();
+        int sz2 = word2[0].size();
+        while (i1 < len1 && i2 < len2)
+        {
+            while (j1 < sz1 && j2 < sz2)
+            {
+                if (word1[i1][j1] != word2[i2][j2])
+                    return false;
+                ++j1;
+                ++j2;
+            }
+            if (j1 == sz1)
+            {
+                ++i1;
+                if (i1 < len1)
+                {
+                    sz1 = word1[i1].size();
+                    j1 = 0;
+                }
+            }
+            if (j2 == sz2)
+            {
+                ++i2;
+                if (i2 < len2)
+                {
+                    sz2 = word2[i2].size();
+                    j2 = 0;
+                }
+            }
+        }
+        
+        return (i1 == len1 && i2 == len2);
+    }
diff --git a/src/1672.cpp b/src/1672.cpp
@@ -0,0 +1,15 @@
+int maximumWealth(vector<vector<int>>& accounts) {
+        int row = accounts.size();
+        if (row == 0)
+            return 0;
+        int col = accounts[0].size();
+        int maxwealth = 0;
+        for (int i = 0; i < row; ++i)
+        {
+            int wealth = accumulate(accounts[i].begin(), accounts[i].end(), 0);
+            if (wealth >maxwealth)
+                maxwealth = wealth;
+        }
+        
+        return maxwealth;
+    }
diff --git a/src/1678.cpp b/src/1678.cpp
@@ -0,0 +1,28 @@
+string interpret(string command) {
+        stringstream ss;
+        int len = command.size();
+        int i = 0;
+        while (i < len)
+        {
+            if (command[i] == 'G')
+            {
+                ss << 'G';
+                ++i;
+            }
+            else if (command[i] == '(')
+            {
+                if (command[i+1] == ')')
+                {
+                    ss << 'o';
+                    i += 2;
+                }
+                else
+                {
+                    ss << "al";
+                    i += 4;
+                }
+            }
+        }
+        
+        return ss.str();
+    }
diff --git a/src/1684.cpp b/src/1684.cpp
@@ -0,0 +1,23 @@
+int countConsistentStrings(string allowed, vector<string>& words) {
+        int flag[26] = {0};
+        int len = allowed.size();
+        for (int i = 0; i < len; ++i)
+            flag[allowed[i]-'a'] = 1;
+        
+        int sz = words.size();
+        int ct = 0;
+        for (int i = 0; i < sz; ++i)
+        {
+            int n = words[i].size();
+            int j = 0;
+            for (; j < n; ++j)
+            {
+                if (flag[words[i][j]-'a'] == 0)
+                    break;
+            }
+            if (j == n)
+                ++ct;
+        }
+        
+        return ct;
+    }
diff --git a/src/1688.cpp b/src/1688.cpp
@@ -0,0 +1,3 @@
+int numberOfMatches(int n) {
+        return n-1;
+    }
diff --git a/src/1694.cpp b/src/1694.cpp
@@ -0,0 +1,51 @@
+string reformatNumber(string number) {
+        int len = number.size();
+        if (len == 2)
+            return number;
+        
+        string str(len, ' ');
+        int j = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            if (number[i] != ' ' && number[i] != '-')
+                str[j++] = number[i];
+        }
+
+        if (j <= 3)
+            return str.substr(0, j);
+        
+        int r = j%3;
+        int lim = r == 0 ? j : (r == 1 ? j-4 : j-2);
+        int n = 0;
+        if (r == 0)
+            n = j+j/3-1;
+        else if (r == 1)
+            n = j-4+(j-4)/3-1+6;
+        else
+            n = j-2+(j-2)/3-1+3;
+            
+        string res(n, ' ');
+        int i = 0, k = 0;
+        while (i < lim)
+        {
+            res[k++] = str[i++];
+            if (k < n && i%3 == 0)
+                res[k++] = '-';
+        }
+        
+        if (r == 1)
+        {
+            res[k] = str[i];
+            res[k+1] = str[i+1];
+            res[k+2] = '-';
+            res[k+3] = str[i+2];
+            res[k+4] = str[i+3];
+        }
+        else if (r == 2)
+        {
+            res[k] = str[i];
+            res[k+1] = str[i+1];
+        }
+        
+        return res;
+    }
diff --git a/src/1704.cpp b/src/1704.cpp
@@ -0,0 +1,30 @@
+bool halvesAreAlike(string s) {
+        int len = s.size();
+        int n1 = 0, n2 = 0;
+        for (int i = 0; i < len/2; ++i)
+        {
+            switch(tolower(s[i]))
+            {
+                case 'a':
+                case 'e':
+                case 'i':
+                case 'o':
+                case 'u':
+                    ++n1;                    
+            }
+        }
+        for (int i = len/2; i < len; ++i)
+        {
+            switch(tolower(s[i]))
+            {
+                case 'a':
+                case 'e':
+                case 'i':
+                case 'o':
+                case 'u':
+                    ++n2;                    
+            }
+        }
+        
+        return n1 == n2;
+    }

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+int numberOfMatches(int n) {`
	`2`	`+ return n-1;`
	`3`	`+ }`