<p>Write a function to find the longest common prefix string amongst an array of strings.</p>

<p>If there is no common prefix, return an empty string <code>&quot;&quot;</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> strs = [&quot;flower&quot;,&quot;flow&quot;,&quot;flight&quot;]
<strong>Output:</strong> &quot;fl&quot;
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> strs = [&quot;dog&quot;,&quot;racecar&quot;,&quot;car&quot;]
<strong>Output:</strong> &quot;&quot;
<strong>Explanation:</strong> There is no common prefix among the input strings.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= strs.length &lt;= 200</code></li>
	<li><code>0 &lt;= strs[i].length &lt;= 200</code></li>
	<li><code>strs[i]</code> consists of only lowercase English letters.</li>
</ul>

class Solution {
public:
    static bool compare(string s1, string s2){
        if(s1.length() < s2.length())
            return true;
        else return false;
    }
    string longestCommonPrefix(vector<string>& strs) {
        sort(strs.begin(), strs.end(), compare);
        int n = strs[0].length();
        int len = strs.size();
        int i = 0;
        string ans = "";
        while(i < n){
            int j = 0;
            bool isAns = true;
            while(j < len - 1){
                if(strs[j][i] != strs[j + 1][i]){
                    isAns = false;
                    break;
                }
                j++;
            }
            if(!isAns) break;
            ans += strs[j][i++];
        }
        return ans;
    }
};
14300