Leetcode:longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

Analysis: This problem is not a good way, brute force search comparison can be implemented in C + + has a small trick is "If pos was equal to the string length, the function returns a reference To the null character this follows the last character in the string, which shall isn't be modified "so you don't have to find the minimum length of all strings first. The code is as follows:

classSolution { Public:    stringLongestcommonprefix (vector<string> &STRs) {        if(Strs.empty ())return "";  for(inti =0; I < strs[0].length (); i++)             for(intj =1; J < Strs.size (); J + +){                if(Strs[j][i]! = strs[0][i])returnstrs[0].SUBSTR (0, i); }        returnstrs[0];//Strs[0] is the longest common prefix    }};

Leetcode:longest Common Prefix