题目
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
.
我的尝试
刚开始找到字符串数组中最短的字符串,然后遍历数组,判断每个数组是否startWith最多的字符串。框架已经形成,但是发现如果返回false,需要缩减最短字符串进行判断。在执行缩短代码 minShortString=minShortString.substring(0,minShortString.length()-1);后如何进行重新遍历数组呢?可以while循环,判断缩短后的字符串是否大于0进行循环。另外flag判断while退出刚开始写错了,写在