<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:
    string longestCommonPrefix(vector<string>& strs) {
        string result;
        bool stop = false;
        int prefix_size = 0;
        if(strs.empty())
            return result;
        while(stop == false && prefix_size<strs.at(0).size())
        {
            if(strs.at(0).size() == 0)
            {
                stop = true;
                break;
            }
            char temp = strs.at(0).at(prefix_size);
            for(int i = 1;i<strs.size();i++)
            {
                if(strs.at(i).size() <= prefix_size || strs.at(i).at(prefix_size) != temp)
                {
                    stop = true;
                    break;
                }
            }
            if(stop == false)
                result += temp;
            prefix_size++;
        }
        return result;
    }
};
11000