leetcode 14. Longest Common Prefix

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

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"
Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Note:

All given inputs are in lowercase letters a-z.

来源：力扣（LeetCode）
链接：https://leetcode-cn.com/problems/longest-common-prefix
 

char * longestCommonPrefix(char ** strs, int strsSize){
        //特殊情况～空串
        if(strsSize==0) 
                return "";

        char* subs=strs[0];//第一串作为标准串

       //将第2-n串分别与第一串比较，若是字符相同则指针右移
        for (short i = 1; i < strsSize; ++i)
        {
                short j = 0;
                while (subs[j] !='\0' && strs[i][j]!='\0' && subs[j] == strs[i][j])
                        ++j;

                subs[j]=0;//若是比以前更短，则在子串后面加上'\0'～增量缩短！
    }
    return subs;
}