Update Solution 014 with cpp version

Author: xiapengchng

solution/014.Longest Common Prefix/Solution.cpp

@@ -0,0 +1,37 @@
+static int x=[](){
+    std::ios::sync_with_stdio(false);
+    cin.tie(NULL);
+    return 0;
+}();
+string Compare(string s1,string s2)
+{
+    if(s1.size()==0||s2.size()==0)
+        return "";
+    int num=s1.size()<s2.size()?s1.size():s2.size();
+    string s;
+    for(int i=0;i<num;i++)
+    {
+        if(s1[i]==s2[i])
+        {
+            s.push_back(s1[i]);
+        }
+        else
+            break;
+        
+    }
+    return s;
+}
+class Solution {
+public:
+    string longestCommonPrefix(vector<string>& strs) {
+        if(strs.size()==0)
+            return "";
+        string prefix=strs[0];
+        for(int i=1;i<strs.size();i++)
+        {
+            prefix=Compare(prefix,strs[i]);
+        }
+        return prefix;
+        
+    }
+};

solution/062.Unique Paths/Solution.cpp

@@ -0,0 +1,21 @@
+class Solution {
+public:
+    int uniquePaths(int m, int n) {
+        if(m<=0||n<=0)
+            return 0;
+        if(m==1||n==1)
+            return 1;
+        int arr[m][n]={0};
+        arr[0][0]=1;
+        for(int i=1;i<m;i++)
+            arr[i][0]=1;
+        for(int j=1;j<n;j++)
+            arr[0][j]=1;
+        for(int i=1;i<m;i++)
+            for(int j=1;j<n;j++)
+            {
+                arr[i][j]=arr[i-1][j]+arr[i][j-1];
+            }
+        return arr[m-1][n-1];
+    }
+};