/ Published in: PHP
sorting, searching in array, some string function
Expand |
Embed | Plain Text
Copy this code and paste it in your HTML
//-------------------- // 基本数æ®ç»“æž„ //-------------------- //二分查找(数组里查找æŸä¸ªå…ƒç´ ) function bin_sch($array, $low, $high, $k){ if ($low <= $high){ if ($array[$mid] == $k){ return $mid; }elseif ($k < $array[$mid]){ return bin_sch($array, $low, $mid-1, $k); }else{ return bin_sch($array, $mid+1, $high, $k); } } return -1; } //顺åºæŸ¥æ‰¾ï¼ˆæ•°ç»„里查找æŸä¸ªå…ƒç´ ) function seq_sch($array, $n, $k){ $array[$n] = $k; for($i=0; $i<$n; $i++){ if($array[$i]==$k){ break; } } if ($i<$n){ return $i; }else{ return -1; } } //çº¿æ€§è¡¨çš„åˆ é™¤ï¼ˆæ•°ç»„ä¸å®žçŽ°ï¼‰ function delete_array_element($array, $i) { for ($j=$i; $j<$len; $j++){ $array[$j] = $array[$j+1]; } return $array; } //冒泡排åºï¼ˆæ•°ç»„排åºï¼‰ function bubble_sort($array) { if ($count <= 0) return false; for($i=0; $i<$count; $i++){ for($j=$count-1; $j>$i; $j--){ if ($array[$j] < $array[$j-1]){ $tmp = $array[$j]; $array[$j] = $array[$j-1]; $array[$j-1] = $tmp; } } } return $array; } //快速排åºï¼ˆæ•°ç»„排åºï¼‰ function quicksort($array) { $key = $array[0]; if ($array[$i] <= $key) $left_arr[] = $array[$i]; else $right_arr[] = $array[$i]; } $left_arr = quicksort($left_arr); $right_arr = quicksort($right_arr); } //------------------------ // PHP内置å—符串函数实现 //------------------------ //å—符串长度 { if ($str == '') return 0; $count = 0; while (1){ if ($str[$count] != NULL){ $count++; continue; }else{ break; } } return $count; } //截å–å串 { if ($start < 0){ $substr .= $str[$i]; } } if ($length > 0){ for ($i=$start; $i<($start+$length); $i++) { $substr .= $str[$i]; } } if ($length < 0){ $substr .= $str[$i]; } } return $substr; } //å—符串翻转 { if ($str == '') return 0; $rev_str .= $str[$i]; } return $rev_str; } //å—符串比较 { if ($s1[$i] == $s2[$i]){ continue; }else{ return false; } } return 0; } //查找å—符串 { if ($m < $n) return false; for ($i=0; $i<=($m-$n+1); $i++){ } return false; } //å—ç¬¦ä¸²æ›¿æ¢ { for ($i=0; $i<=($m-$n+1); $i++){ $str = str_delete($str, $i, $n); $str = str_insert($str, $i, $newstr); } return $str; } //-------------------- // 自实现函数 //-------------------- //æ’入一段å—符串 function str_insert($str, $i, $substr) { for($j=0; $j<$i; $j++){ $startstr .= $str[$j]; } $laststr .= $str[$j]; } $str = ($startstr . $substr . $laststr); return $str; } //åˆ é™¤ä¸€æ®µå—符串 function str_delete($str, $i, $j) { for ($c=0; $c<$i; $c++){ $startstr .= $str[$c]; } $laststr .= $str[$c]; } $str = ($startstr . $laststr); return $str; } //å¤åˆ¶å—符串 function strcpy($s1, $s2) { $s2[] = $s1[$i]; } return $s2; } //连接å—符串 function strcat($s1, $s2) { $newstr = $s1; $newstr .= $st[$i]; } return $newsstr; } //简å•ç¼–ç 函数(与php_decode函数对应) function php_encode($str) { if ($c>31 && $c<107) $c += 20; if ($c>106 && $c<127) $c -= 75; $s .= $word; } return $s; } //简å•è§£ç 函数(与php_encode函数对应) function php_decode($str) { if ($c>106 && $c<127) $c = $c-20; if ($c>31 && $c<107) $c = $c+75; $s .= $word; } return $s; } //简å•åŠ 密函数(与php_decrypt函数对应) function php_encrypt($str) { $encrypt_key = 'abcdefghijklmnopqrstuvwxyz1234567890'; $decrypt_key = 'ngzqtcobmuhelkpdawxfyivrsj2468021359'; if ($str[$i] == $encrypt_key[$j]){ $enstr .= $decrypt_key[$j]; break; } } } return $enstr; } //简å•è§£å¯†å‡½æ•°ï¼ˆä¸Žphp_encrypt函数对应) function php_decrypt($str) { $encrypt_key = 'abcdefghijklmnopqrstuvwxyz1234567890'; $decrypt_key = 'ngzqtcobmuhelkpdawxfyivrsj2468021359'; if ($str[$i] == $decrypt_key[$j]){ $enstr .= $encrypt_key[$j]; break; } } } return $enstr; }
URL: http://www.phpchina.com/?732/action_viewspace_itemid_2118.html