//冒泡排序(數組排序)
function bubble_sort($array)
{
$count = count($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)
{
if (count($array) <= 1) return $array;
$key = $array[0];
$left_arr = array();
$right_arr = array();
for ($i = 1; $i < count($array); $i++) {
if ($array[$i] <= $key)
$left_arr[] = $array[$i];
else
$right_arr[] = $array[$i];
}
$left_arr = quicksort($left_arr);
$right_arr = quicksort($right_arr);
return array_merge($left_arr, array($key), $right_arr);
}
function bin_sch($array, $low, $high, $k)
{
if ($low <= $high) {
$mid = intval(($low + $high) / 2);
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;
}
}
如 $a = \/a/b/c/d/e.php\;
$b = \/a/b/12/34/c.php\;
計算出 $b 相對於 $a 的相對路徑應該是 ../../c/d將()添上
function getRelativepath($a, $b)
{
$returnpath = array(dirname($b));
$arrA = explode(\/\, $a);
$arrB = explode(\/\, $returnpath[0]);
for($n = 1, $len = count($arrB); $n < $len; $n++) {
if($arrA[$n] != $arrB[$n]){
break;
}
}
if($len - $n > 0){
$returnpath = array_merge($returnpath, array_fill(1, $len - $n, \. . \));
}
$returnpath = array_merge($returnpath, array_slice($arrA, $n));
return implode(\/\, $returnpath);
}
echo getRelativepath($a, $b);
4. 請寫一段pHp代碼,確保多個進程同時寫入同一個文件成功
function writeData($path, $mode, $data)
{
$fp = fopen($path, $mode);
$retries = 0;
$max_retries = 100;
do {
if ($retries > 0) {
usleep(rand(1, 10000));
}
$retries += 1;
} while (!flock($fp, LOCK_EX) and $retries <= $max_retries);
if ($retries == $max_retries) {
return false;
}
fwrite($fp, "$data\\n");
flock($fp, LOCK_UN);
fclose($fp);
return true;
}
class deque
{
public $queue = array();
public $length = 0;
public function frontAdd($node)
{
array_unshift($this->queue, $node);
$this->countqueue();
}
public function frontRemove()
{
$node = array_shift($this->queue);
$this->countqueue();
return $node;
}
public function rearAdd($node)
{
array_push($this->queue, $node);
$this->countqueue();
}
public function rearRemove()
{
$node = array_pop($this->queue);
$this->countqueue();
return $node;
}
public function countqueue()
{
$this->length = count($this->queue);
}
}