題目：獲取字符串最長重復(fù)的子字符串

input：qweertqwer
output：qwe

input：qwertyuie
output：e

input：abcdefefefef
output：efef

<?php

$string = 'abcdefefefef';
var_dump(getSubStr($string));

function getSubStr($string){

    $stringLen = strlen($string);
    //最長情況為半長字符串
    for($l=floor($stringLen/2);$l>0;$l--){
        for($i=0;$i<($stringLen-$l)&&($i+2*$l)<=$stringLen;$i++){
            //最長子串
            $res = substr($string, $i, $l);
            //剩下的字符串
            $left = substr($string, $i+$l);
            if(strpos($left,$res)!==false){
                return $res;
            }
        }
    }
    return false;
}