14. Longest Common Prefix

  • Question Description
    在这里插入图片描述
  • My Key
package LeetCode;
public class Test {
      
      public static void main(String[] args) {
            String[] str1 = {"flower","flow","flight"};
            System.out.println(longestCommonPrefix(str1));
            
            String[] str2 = {"dog","racecar","car"};
            System.out.println(longestCommonPrefix(str2));
            
            String[] str3 = {"acc","aaa","aaba"};
            System.out.println("str3:"+longestCommonPrefix(str3));
            
            String[] str4 = {"aa","a"};
            System.out.println("str4:"+longestCommonPrefix(str4));
      }
      
      public static String longestCommonPrefix(String[] strs) {
            if (strs.length == 0 || strs == null) {
                  return "";
            } else if (strs.length == 1) {
                  return strs[0];
            } else {
                  int minLen = strs[0].length();
                  String commonPrefix = strs[0].substring(0, minLen);
                  StringBuffer res = new StringBuffer();
                  
                  for (int i = 1; i < strs.length; i++) {
                        if (res.length() != 0) {
                              res.delete(0, res.length());
                        }
                        minLen = Math.min(minLen, strs[i].length());
                        
                        for (int j = 0; j < minLen; j++) {
                              if (commonPrefix.charAt(j) ==  strs[i].charAt(j)) {
                                    res.append(commonPrefix.charAt(j));
                                    continue;
                              } else {
                                    minLen = j;
                                    break;
                              }
                        }
                        if(res.length() == 0) {
                              break;
                        }
                  }
                  return res.toString();
            }
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值