14. Longest Common Prefix

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.

Java

class Solution { public String longestCommonPrefix(String[] strs) { if(strs.length == 0) return ""; char[] str = strs[0].toCharArray(); int Min = str.length; for(int i = 1;i < strs.length;i++){ char[] s = strs[i].toCharArray(); int j = 0; while(j < Min && j < s.length && s[j] == str[j]) j++; Min = Min > j?j:Min; } return strs[0].substring(0,Min); }}

class Solution { public String longestCommonPrefix(String[] strs) { if (strs == null || strs.length == 0) return ""; String res = strs[0]; for (int i=1; i 0) res = res.substring(0, res.length()-1); return res; }}

class Solution { public String longestCommonPrefix(String[] strs) { StringBuilder prefix = new StringBuilder(); if (strs != null && strs.length > 0) { Arrays.sort(strs); char[] a = strs[0].toCharArray(); char[] b = strs[strs.length - 1].toCharArray(); for (int i = 0; i < a.length; i++) { if (b.length > i && b[i] == a[i]) { prefix.append(b[i]); } else { return prefix.toString(); } } } return prefix.toString(); }}

class Solution { public String longestCommonPrefix(String[] strs) { int n= strs.length; String prefix = strs[0]; //prefix string to be returned for(int i=1; i

JS

/** * @param {string[]} strs * @return {string} */var longestCommonPrefix = function(strs) { let result = ""; if (!strs.length) return result; for (let i = 0; i < strs[0].length; i++) { const start = strs[0].slice(0, i + 1); if (strs.every(word => word.startsWith(start))) { result = start; } else { break; } } return result;};

class Solution {public: string longestCommonPrefix(vector& strs) { if(strs.size() == 0) { return ""; } sort(strs.begin(), strs.end()); int i; string a = strs[0]; string b = strs[strs.size()-1]; string ans = ""; for(i=0; i

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。