【Leetcode】Longest Common Prefix

来源:互联网 发布:香江四大才子 知乎 编辑:程序博客网 时间:2024/06/08 06:20

Write a function to find the longest common prefix string amongst an array of strings.

其实这道题说的不清楚,它想问的simply就是一群string的公共prefix是啥……

简单我就不解释了………………

package testAndfun;public class LongestCommonPrefix {public static void main(String[] args){LongestCommonPrefix lm = new LongestCommonPrefix();String[] input = {"internet","inspiration","income"};System.out.println(lm.longestCommonPrefix(input));}public String longestCommonPrefix(String[] strs) {        String prefix = new String();        if(strs.length==0)return prefix;        int k=0;        while(true){        if(k==strs[0].length())break;        char p =strs[0].charAt(k);        int i=1;        for(;i<strs.length;i++){        if(k==strs[i].length())break;        if(p!=strs[i].charAt(k))        break;        }        if(i!=strs.length)break;        prefix += p;        k++;        }        return prefix;    }}


0 0
原创粉丝点击