LeetCode——LongestCommonPrefix

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.

解法一——纵向比较

拿strs[0]的每一位与数组中每一个字符串对应位相比较，若相等则将此位字符加入res，若不相等则返回此时的res，若是循环结束还没有返回值，则strs[0]为最长公共字符串

public String longestCommonPrefix(String[] strs)
	{
		if(strs==null||strs.length==0)
			return "";
		String res=new String();
		for(int i=0;i<strs[0].length();i++){
			char c=strs[0].charAt(i);
			for(int j=1;j<strs.length;j++)
			{
				if(i>strs[j].length()||strs[j].charAt(i)!=c)
					return res;
			}
			res+=Character.toString(c);
		}
		return strs[0];
	}

Runtime: 4 ms, faster than 99.85% of Java online submissions for Longest Common Prefix.
Memory Usage: 39.1 MB, less than 11.26% of Java online submissions for Longest Common Prefix.

解法二——排序后比较

将数组排序之后，比较第一个字符串和最后一个字符串即可得到最长公共字符串

public String longestCommonPrefix(String[] strs){
		if(strs==null||strs.length==0)
			return "";
		Arrays.sort(strs);
		int i;
		for(i=0;i<strs[0].length()&&i<strs[strs.length-1].length();i++)
		{
			if(strs[0].charAt(i)!=strs[strs.length-1].charAt(i))
				break;
		}
		return strs[0].substring(0,i);
	}

Runtime: 4 ms, faster than 99.85% of Java online submissions for Longest Common Prefix.
Memory Usage: 39.1 MB, less than 11.48% of Java online submissions for Longest Common Prefix.

一开始写了一种比较蠢的方法，用第一个字符串跟后面的每个字符串比较，每次取其公共字符串，若是公共字符串为零则返回""，但不知为什么提交不成功。

	public String longestCommonPrefix(String[] strs)
	{
		if(strs==null||strs.length==0)
			return "";
		String common=new String(strs[0]);
		for(int i=1;i<strs.length;i++)
		{
			if(common.equals(""))
				return "";
			int j;
			for(j=0;j<common.length()&&j<strs[i].length();j++)
			{
				if(common.charAt(j)!=strs[i].charAt(j))
					break;
			}
			common=common.substring(0, j);
		}
		return common;
	}