<?php//不用第三個(gè)變量，交換兩個(gè)變量的值function changeVar(){    $a = '123';    $b = '456';        list($a, $b) = array($b, $a);        echo $a . '-' . $b;}//文件鎖function fileLock(){    $fp = fopen('./tmp.txt', 'w+');    if (flock($fp, LOCK_EX)) { //獨(dú)占鎖定        fwrite($fp, 'write something/n');        flock($fp, LOCK_UN);//釋放鎖    } else {        echo "can't lock!";    }    fclose($fp);}//獲取文件后綴function getExtName($url){    $path_info = pathinfo($url);    $ext_name = $path_info['extension'];    echo $ext_name;}/*斐波那契數(shù)列第n位是什么，遞歸實(shí)現(xiàn)* @param int $n 位數(shù)*/function fibonacci($n){    $return = 1;    if ($n <= 0) {        $return = 0;    } elseif ($n <= 2) {        $return = 1;    } else {        $return = fibonacci($n - 2) + fibonacci($n - 1);    }    return $return;}//自己實(shí)現(xiàn)number_formatfunction numFormat($num){    // return number_format($num);    $num = strrev($num);//反轉(zhuǎn)    $num = str_split($num, 3);//分割成數(shù)組    $num = implode(',', $num);//拼接    $num = strrev($num);//再反轉(zhuǎn)    return $num;}//冒泡排序function bubble_sort(&$arr){    $len = count($arr);    for ($i = 0; $i < $len; $i++) {        for ($j = 1; $j < $len - $i; $j++) {            if ($arr[$j - 1] > $arr[$j]) {                $tmp = $arr[$j];                $arr[$j] = $arr[$j - 1];                $arr[$j - 1] = $tmp;            }        }    }}//快速排序function quickSort($arr){    $len = count($arr);    if ($len <= 1) {        return $arr;    }    $base = $arr[0];    $left_array = array();    $right_array = array();    for ($i = 1; $i < $len; $i++) {        if ($arr[$i] > $base) {            $left_array[] = $arr[$i];        } else {            $right_array[] = $arr[$i];        }    }    $left_array = quickSort($left_array);    $right_array = quickSort($right_array);    return $left_array;}//二維數(shù)組排序function array_sort($arr, $keys, $order = 'ASC'){    if (!is_array($arr)) {        return false;    }    $keyshtml' target='_blank'>value = array();    foreach ($arr as $k => $v) {        $keysvalue[$k] = $v[$keys];    }    if ($order == 'ASC') {        asort($keysvalue);    } else {        arsort($keysvalue);    }    reset($keysvalue);    foreach ($keysvalue as $k => $v) {        $keysort[$k] = $k;    }    foreach ($keysort as $k => $v) {        $new_arr[] = $arr[$v];    }        return $new_arr;}//使用自帶函數(shù)二維數(shù)組排序function array_sort2(&$arr, $keys, $order = SORT_ASC){    array_multisort(array_column($arr, $keys), $order, $arr);}//二分查找function bin_sch($arr, $low, $top, $target){    sort($arr);    while ($low <= $top) {        $mid = floor(($low + $top)/2);        if ($arr[$mid] == $target) {            return $arr[$mid];        } elseif ($arr[$mid] < $target) {            $low = $mid + 1;            bin_sch($arr, $low, $top, $target);        } else {            $top = $mid - 1;            bin_sch($arr, $low, $top, $target);        }    }    return -1;}//遍歷文件夾function my_scandir($dir){    $files = array();    if ($handle = opendir($dir)) {        while (($filename = readdir($handle)) !== false) {            if ($filename != '.' && $filename != '..') {                if (is_dir($dir."/".$filename)) {                    $files[$filename] = my_scandir($dir."/".$filename);                } else {                    $files[] = $filename;                }            }        }         closedir($handle);        return $files;    }}//get_user_id改為getUserIdfunction change($str){    $str = ucwords($str, '_');    return str_replace('_', '', $str);}//反轉(zhuǎn)每個(gè)單詞function convert($input) {    $arr = explode(" ", $input);    array_walk($arr, function (&$value) {        $value = strrev($value);    });    $output =  implode(" ", $arr);    echo $output;}

相關(guān)推薦：

2018前端面試常見(jiàn)算法題

JavaScript 面試中常見(jiàn)算法問(wèn)題詳解

PHP兌現(xiàn)的幾種常見(jiàn)算法

以上就是PHP常見(jiàn)算法或函數(shù)詳解的詳細(xì)內(nèi)容，更多請(qǐng)關(guān)注 其它相關(guān)文章！

鄭重聲明：本文版權(quán)歸原作者所有，轉(zhuǎn)載文章僅為傳播更多信息之目的，如作者信息標(biāo)記有誤，請(qǐng)第一時(shí)間聯(lián)系我們修改或刪除，多謝。