Package g0001_0100.s0014_longest_common_prefix

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    14 - Longest Common Prefix\.

    Easy

    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: strs = "flower","flow","flight"

    Output: "fl"

    Example 2:

    Input: strs = "dog","racecar","car"

    Output: ""

    Explanation: There is no common prefix among the input strings.

    Constraints:

    • 1 <= strs.length <= 200

    • 0 <= strs[i].length <= 200

    • strs[i] consists of only lower-case English letters.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final String longestCommonPrefix(Array<String> strs)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait