<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 prefix = "";

        if (strs.size() == 0)
        {
            return prefix;
        }

        if (strs.size() == 1)
        {
            return strs[0];
        }

        int indexOfStringWithShortestLength = 0;
        int ShortestStringLength = strs[0].length();

        for (int i = 1; i < strs.size(); i++)
        {
            if (strs[i].length() < strs[indexOfStringWithShortestLength].length())
            {
                indexOfStringWithShortestLength = i;
                ShortestStringLength = strs[i].length();
            }
        }

        string checkString = strs[0];
        string thisChar = "";
        string checkChar = "";
        bool addToPrefix = true;
        for (int i = 0; i < ShortestStringLength; i++)
        {
            thisChar = checkString[i];
            for (int j = 1; j < strs.size(); j++)
            {
                checkChar = strs[j];
                checkChar = checkChar[i];
                if (thisChar != checkChar)
                {
                    addToPrefix = false;
                }
            }
            if (addToPrefix == false)
            {
                break;
            }
            prefix.append(thisChar);
        }

        return prefix;
    }
};
12300