LeetCode题解之 Longest Common Prefix

1、题目描述

2、问题分析

直接使用循环解决问题

3、代码

 string longestCommonPrefix(vector<string>& strs) {
         string res = "";
         if(strs.size() == )
             return res;

         bool isFull = true;
         bool isEqual = true;
         int pre = ;
         while(isFull &&  isEqual){
             vector<string>::iterator it = strs.begin();
             if( pre == (*it).size() ){
                     isFull = false;
                     break;
             }
             string s1 = (*it).substr(pre,);

             for( it = strs.begin() + ; it != strs.end(); ++it ){
                 if( (*it).substr(pre,) != s1 ){
                    isEqual = false;
                     break;
                 }

                 if( pre == (*it).size() ){
                     isFull = false;
                     break;
                 }
             }

             if( isEqual && isFull )
                 res += s1;
             pre++;
         }
         return res;

     }