日韩性视频-久久久蜜桃-www中文字幕-在线中文字幕av-亚洲欧美一区二区三区四区-撸久久-香蕉视频一区-久久无码精品丰满人妻-国产高潮av-激情福利社-日韩av网址大全-国产精品久久999-日本五十路在线-性欧美在线-久久99精品波多结衣一区-男女午夜免费视频-黑人极品ⅴideos精品欧美棵-人人妻人人澡人人爽精品欧美一区-日韩一区在线看-欧美a级在线免费观看

歡迎訪問 生活随笔!

生活随笔

當前位置: 首頁 > 编程资源 > 编程问答 >内容正文

编程问答

LeetCode - Easy - 14. Longest Common Prefix

發布時間:2023/12/13 编程问答 39 豆豆
生活随笔 收集整理的這篇文章主要介紹了 LeetCode - Easy - 14. Longest Common Prefix 小編覺得挺不錯的,現在分享給大家,幫大家做個參考.

Topic

  • String

Description

https://leetcode.com/problems/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: strs = ["flower","flow","flight"] Output: "fl"

Example 2:

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

Constraints:

  • 0 <= strs.length <= 200
  • 0 <= strs[i].length <= 200
  • strs[i] consists of only lower-case English letters.

Analysis

Submission

public class LongestCommonPrefix {// 方法一:我寫的public String longestCommonPrefix1(String[] strs) {if (strs == null || strs.length == 0)return "";StringBuilder sb = new StringBuilder();out: for (int i = 0; i < strs[0].length(); i++) {char current = strs[0].charAt(i);for (int j = 1; j < strs.length; j++) {if (strs[j].length() == i || strs[j].charAt(i) != current)break out;}sb.append(current);}return sb.toString();}// 方法二:public String longestCommonPrefix2(String[] strs) {if (strs == null || strs.length == 0)return "";for (int i = 0; i < strs[0].length(); i++) {char current = strs[0].charAt(i);for (int j = 1; j < strs.length; j++) {if (strs[j].length() == i || strs[j].charAt(i) != current)return strs[0].substring(0, i);}}return strs[0];}// 方法三:public String longestCommonPrefix3(String[] strs) {if (strs == null)return null;if (strs.length == 0)return "";String theShortest = strs[0], theLongest = strs[0];for (String str : strs) {if (str.compareTo(theShortest) < 0)theShortest = str;if (str.compareTo(theLongest) > 0)theLongest = str;}int i = 0;while (i < theShortest.length() && theShortest.charAt(i) == theLongest.charAt(i))i++;return theShortest.substring(0, i); }

Test

import static org.junit.Assert.*; import org.junit.Test;public class LongestCommonPrefixTest {@Testpublic void test() {LongestCommonPrefix obj = new LongestCommonPrefix();final String[] array1 = {"flower", "flow", "flight"};assertEquals("fl", obj.longestCommonPrefix1(array1));assertEquals("fl", obj.longestCommonPrefix2(array1));assertEquals("fl", obj.longestCommonPrefix3(array1));final String[] array2 = {"dog", "racecar", "car"};assertEquals("", obj.longestCommonPrefix1(array2));assertEquals("", obj.longestCommonPrefix2(array2));assertEquals("", obj.longestCommonPrefix3(array2));} }

總結

以上是生活随笔為你收集整理的LeetCode - Easy - 14. Longest Common Prefix的全部內容,希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯,歡迎將生活随笔推薦給好友。