14. Longest Common Prefix

來源:互聯網
上載者:User

標籤:

題目:

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

連結:http://leetcode.com/problems/longest-common-prefix/

一刷:

class Solution(object):    def longestCommonPrefix(self, strs):        """        :type strs: List[str]        :rtype: str        """        if not strs:            return ‘‘        length = len(strs[0])        common_prefix = [‘‘]        chars_at_idx = set()        for idx in range(length):            for one_string in strs:                if len(one_string) <= idx:                    return ‘‘.join(common_prefix)                chars_at_idx.add(one_string[idx])            if len(chars_at_idx) != 1:                return ‘‘.join(common_prefix)            common_prefix.append(chars_at_idx.pop())        return ‘‘.join(common_prefix)

可以減少中間變數和資料結構的使用:

class Solution(object):    def longestCommonPrefix(self, strs):        """        :type strs: List[str]        :rtype: str        """        if not strs:            return ‘‘        length = len(strs[0])        for idx in range(length):            char = strs[0][idx]            for one_string in strs:                if len(one_string) <= idx or one_string[idx] != char:                    return one_string[:idx]        return strs[0]

 

14. Longest Common 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.