14. Longest Common Prefix

最新推荐文章于 2022-03-20 08:23:53 发布

潜水的陈大喵

最新推荐文章于 2022-03-20 08:23:53 发布

阅读量107

点赞数

分类专栏： leetCode Oj

本文链接：https://blog.csdn.net/c_little_white/article/details/82833015

版权

leetCode Oj 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

题目：

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.

我的答案：

class Solution {
    public String longestCommonPrefix(String[] strs) {
        if(strs.length == 0) {
            return "";
        }
        StringBuffer sb = new StringBuffer("");
        char c = ' ';
        for(int i = 0; i < strs[0].length(); i++) {
            c = strs[0].charAt(i);
            int j;
            for(j = 1; j < strs.length; j++) {
                if(i >= strs[j].length() || c != strs[j].charAt(i)) {
                    break;
                }
            }
            if(j == strs.length) {
                sb.append(c);
            } else {
                break;
            }
        }
        return sb.toString();
        
    }
}