Open lalalei21 opened 5 years ago
https://lalalei21.github.io/2019/04/23/14-LCP/#more
Description: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 “”. Do it now! 方法1:Vertical scanning(垂直扫描) 思想:同一列
https://lalalei21.github.io/2019/04/23/14-LCP/#more
Description: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 “”. Do it now! 方法1:Vertical scanning(垂直扫描) 思想:同一列