LeetCode/string/LongestCommonPrefix.java
// LC solution #1 (Horizontal scanning)
LC solution #1 (Horizontal scanning)
LC solution #1 ( Horizontal scanning )
public String longestCommonPrefixSolOne(String[] strs) {
        if (strs.length == 0) {
            return "";
        }
        String prefix = strs[0];
        for (int i = 1; i < strs.length; i++)
            while (strs[i].indexOf(prefix) != 0) {
                prefix = prefix.substring(0, prefix.length() - 1);
                if (prefix.isEmpty())
                    return "";
            }
        return prefix;
    }
public String longestCommonPrefixSolOne ( String [ ] strs ) { if ( strs . length == 0 ) { return "" ; } String prefix = strs [ 0 ] ; for ( int i = 1 ; i < strs . length ; i ++ ) while ( strs [ i ] . indexOf ( prefix ) != 0 ) { prefix = prefix . substring ( 0 , prefix . length ( ) - 1 ) ; if ( prefix . isEmpty ( ) ) return "" ; } return prefix ; }
LC solution #1 (Horizontal scanning)
LC solution #1 ( Horizontal scanning )
// get the first word as prefix // compare the value // remove last character from the prefix // no common string was found