Shulou(Shulou.com)06/01 Report--

This article mainly shows you "LeetCode how to solve the longest common prefix in a string", which is easy to understand and well-organized. I hope it can help you solve your doubts. Let me lead you to study and learn "LeetCode how to solve the longest common prefix in a string".

Topic description: write a function to find the longest common prefix in the string array, and return an empty string if there is no common prefix.

Example:

Input: ["flower", "flow", "flight"] output: "fl"

Input: ["dog", "racecar", "car"] output: "" # there is no common prefix

All inputs contain only the lowercase letter aasthz

Algorithm idea

1. First of all, it is judged that the input is empty.

two。 Set the last string to be returned: final_str3. Find the shortest string length in the string array to facilitate subsequent traversal: shortest_str4. Core code: traverses the characters in the same position (that is, the same subscript) of each string in the string array in order. If the characters are different: indicating that the character in the current position is not a common prefix, directly return the stored final_str. If the characters are the same: until the end of the loop of the current subscript, add this character to the final_str.

Special solution

A rule can be found according to the title: (not length! )

Longest common prefix of string array = longest common prefix of minimum string in alphabetical order and maximum string in alphabetical order

The above is all the content of the article "how to solve the longest common prefix in a string by LeetCode". Thank you for reading! I believe we all have a certain understanding, hope to share the content to help you, if you want to learn more knowledge, welcome to follow the industry information channel!

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.