5 problems solved.

lintcoder · lintcoder · commit 55a13cb94d75 · 2022-01-01T17:01:41.000+08:00
diff --git a/src/1807.cpp b/src/1807.cpp
@@ -0,0 +1,36 @@
+string evaluate(string s, vector<vector<string>>& knowledge) {
+        int len = knowledge.size();
+        map<string, string> dict;
+        for (int i = 0; i < len; ++i)
+            dict.insert(make_pair(knowledge[i][0], knowledge[i][1]));
+        
+        stringstream ss;
+        int sz = s.size();
+        int i = 0;
+        while (i < sz)
+        {
+            if (s[i] != '(')
+            {
+                ss << s[i];
+                ++i;
+            }
+            else
+            {
+                string key;
+                key.reserve(10);
+                int j = i+1;
+                while (j < sz && s[j] != ')')
+                {
+                    key.push_back(s[j]);
+                    ++j;
+                }
+                if (dict.find(key) != dict.end())
+                    ss << dict[key];
+                else
+                    ss << '?';
+                i = j+1;
+            }
+        }
+        
+        return ss.str();
+    }
diff --git a/src/2108.cpp b/src/2108.cpp
@@ -0,0 +1,20 @@
+string firstPalindrome(vector<string>& words) {
+        int len = words.size();
+        for (int i = 0; i < len; ++i)
+        {
+            bool flag = true;
+            int sz = words[i].size();
+            for (int j = 0; j < sz/2; ++j)
+            {
+                if (words[i][j] != words[i][sz-1-j])
+                {
+                    flag = false;
+                    break;
+                }
+            }
+            if (flag)
+                return words[i];
+        }
+        
+        return "";
+    }
diff --git a/src/2114.cpp b/src/2114.cpp
@@ -0,0 +1,12 @@
+int mostWordsFound(vector<string>& sentences) {
+        int len = sentences.size();
+        int maxn = 0;
+        for (int i = 0; i < len; ++i)
+        {
+            int n = count(sentences[i].begin(), sentences[i].end(), ' ');
+            if (n > maxn)
+                maxn = n;
+        }
+        
+        return maxn+1;
+    }
diff --git a/src/2119.cpp b/src/2119.cpp
@@ -0,0 +1,3 @@
+bool isSameAfterReversals(int num) {
+        return num >= 10 ? num%10 != 0 : true;
+    }
diff --git a/src/2120.cpp b/src/2120.cpp
@@ -0,0 +1,40 @@
+vector<int> executeInstructions(int n, vector<int>& startPos, string s) {
+        int len = s.size();
+        vector<int> res(len, 0);
+        for (int i = 0; i < len; ++i)
+        {
+            int r = startPos[0], c = startPos[1];
+            int j = i;
+            for (; j < len; ++j)
+            {
+                if (s[j] == 'L')
+                {
+                    if (c == 0)
+                        break;
+                    --c;
+                }
+                else if (s[j] == 'R')
+                {
+                    if (c == n-1)
+                        break;
+                    ++c;
+                }
+                else if (s[j] == 'U')
+                {
+                    if (r == 0)
+                        break;
+                    --r;
+                }
+                else
+                {
+                    if (r == n-1)
+                        break;
+                    ++r;
+                }
+            }
+            
+            res[i] = j-i;
+        }
+        
+        return res;
+    }

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+bool isSameAfterReversals(int num) {`
	`2`	`+ return num >= 10 ? num%10 != 0 : true;`
	`3`	`+ }`