<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 {
private:
    static bool comp(string & v1, string & v2){
        return v1.size() > v2.size();
    }
public:
    string longestCommonPrefix(vector<string>& strs) {

        int s_size = strs.size();
        if (s_size == 0) return "";
        else if (s_size == 1) return strs[0];

        sort(strs.begin(), strs.end(), comp);

        list<string> subs;

        for(int l = strs[0].length(); l > 0; --l){
            string sub = strs[0].substr(0, l);
            bool all_suff = true;
            for (int j = 1; j < s_size; ++j)
                if (sub !=  strs[j].substr(0, l)){
                    all_suff = false;
                    break;    
                }
            if (all_suff) return sub;
        }       

        return "";
    }

    
};
16200