leetcode--Longest Common Prefix

來源:互聯網
上載者:User

標籤:class   blog   code   java   com   string   

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

public class Solution {    public String longestCommonPrefix(String[] strs) {        String prefix = "";int length = strs.length;if(length > 0){prefix = strs[0];int prefixLength = strs[0].length();for(int i = 1; i < length; ++i){int k = 0;int strLength = strs[i].length();for(int j = 0; j < Math.min(prefixLength, strLength); ++j){if(prefix.charAt(j) == strs[i].charAt(j))++k;elsebreak;}prefix = strs[i].substring(0, k);prefixLength = k;            if( k == 0)                break;}}return prefix;      }}

  

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.