zoukankan html css js c++ java

查找字符串数组中的最长公共前缀

<!DOCTYPE html>
<html lang="en">
<head>
  <meta charset="UTF-8">
  <meta name="viewport" content="width=device-width, initial-scale=1.0">
  <meta http-equiv="X-UA-Compatible" content="ie=edge">
  <title>Document</title>
</head>
<body>
  <script>
    var myarr = ["flaaower","flaaow","flaight"]
    function getLongestCommonPrefix(){
      myarr.sort();//按編碼排序
      if(myarr.length === 0) return ''; // 如果是空數組直接返回''
      var first = myarr[0], end = myarr[myarr.length-1];
      if(first === end || end.match(eval('/^' + first + '/'))){
        return first; //first包含于end返回first
      }
      for(var i =0;i<first.length;i++){
        if(first[i] !== end[i]){
          return first.substring(0,i);//匹配失敗時候返回相應字符串
        }
      }
    }
    console.log(getLongestCommonPrefix());  //'fla'
    </script>
</body>
</html>

查看全文

相关阅读:
c语言7-4
c语言 7-4
dfs
dfs
二进制搜索
 BFS
搜索多层图
 八皇后
 线段树-周长并
 线段树

原文地址：https://www.cnblogs.com/sugartang/p/12163171.html