Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) 
    {
        const int n=strs.size();
        if(n==0)
            return "";
        else if(n==1)
            return strs[0];
        else
        {
            int index=0;
            string res="";
            char temp=strs[0][index];
            while(true)
            {
                for(int i=1;i<n;++i)
                {
                    if(index<strs[i].size() && strs[i][index]==temp)
                    {
                        if(i==n-1)
                        {
                            res+=temp;
                            ++index;
                            temp=strs[0][index];
                        }
                    }
                    else
                    {
                        return res;
                    }
                }
            }
        }
        
    }
};