-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy pathAudition.php
More file actions
210 lines (194 loc) · 4.93 KB
/
Audition.php
File metadata and controls
210 lines (194 loc) · 4.93 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
<?php
//快速排序
function quickSort($arr) {
$len = count($arr);
if ($len <= 1) {return $arr;}
$v = $arr[0];
$low = $up = array();
for ($i = 1; $i < $len; ++$i) {
if ($arr[$i] > $v) {
$up[] = $arr[$i];
} else {
$low[] = $arr[$i];
}
}
$low = quickSort($low);
$up = quickSort($up);
return array_merge($low, array($v), $up);
}
//冒泡排序
function getPao($arr) {
$len = count($arr);
for ($i = 1; $i <= $len - 1; ++$i) {
for ($k = 0; $k < $len - $i; ++$k) {
if ($arr[$k] > $arr[$k+1]) {
list($arr[$k], $arr[$k+1]) = array($arr[$k+1], $arr[$k]);
}
}
}
return $arr;
}
//插入排序
function insert_sort($arr) {
$len = count($arr);
for ($i = 1; $i < $len; $i++) {
$tmp = $arr[$i];
$j = $i - 1;
while ($arr[$j] > $tmp) {
$arr[$j+1] = $arr[$j];
$arr[$j] = $tmp;
$j--;
}
}
return $arr;
}
//选择排序
function select_sort($arr) {
$len = count($arr);
for ($i = 0; $i < $len; $i++) {
$k = $i;
for ($j = $i + 1; $j < $len; $j++) {
if ($arr[$k] > $arr[$j]) {
$k = $j;
}
if ($k != $i) {
$tmp = $arr[$i];
$arr[$i] = $arr[$k];
$arr[$k] = $tmp;
}
}
}
return $arr;
}
//二维数组排序
function array_sort($arr, $key, $order = 0) {
$tmp = $new_arr = array();
foreach ($arr as $k => $v) {
$tmp[$k] = $v[$key];
}
if ($order == 0) {
asort($tmp);
} else {
arsort($tmp);
}
foreach ($tmp as $k => $v) {
$new_arr[$k] = $arr[$k];
}
return $new_arr;
}
//顺序查找
function seq_sch($arr, $k) {
for ($i = 0, $len = count($arr); $i < $len; $i++) {
if ($arr[$i] == $k) {
break;
}
}
return $i < $n ? $i : -1;
}
//二分查找/折半查找(数组需事先排序好)
function bin_search($arr, $low, $high, $k) {
if ($low <= $high) {
$mid = intval(($low + $high) / 2);
if ($arr[$mid] == $k) {
return $mid;
} elseif ($k < $arr[$mid]) {
return bin_search($arr, $low, $mid-1, $k);
} else {
return bin_search($arr, $mid+1, $high, $k);
}
}
return false;
}
//二分查找-非递归
function bin_search($arr, $low, $high, $value) {
while ($low <= $high) {
$mid = floor(($low + $high) / 2);
if ($value == $arr[$mid])
return $mid;
elseif ($value < $arr[$mid])
$high = $mid-1;
else
$low = $mid+1;
}
return false;
}
//猴子问题
function king($n, $m) {
$arr = range(1, $n);
$i = 0;
while (count($arr) > 1) {
++$i;
$head = array_shift($arr);
if ($i % $m != 0) {
array_push($arr, $head);
}
}
return $arr[0];
}
//无限极分类
function tree($arr, $pid = 0, $level = 0) {
static $list = array();
foreach ($arr as $key => $val) {
if ($val['parent_id'] == $pid) {
$val['level'] = $level;
$list[] = $val;
unset($arr[$key]);
tree($arr, $val['cat_id'], $level+1);
}
}
return $list;
}
//遍历文件夹
function sdir($dir) {
$arr = array();
if (is_dir($dir)) {
if ($handle = opendir($dir)) {
while ($file = readdir($handle) !== false) {
if ($file != '.' && $file != '..') {
if (is_dir($dir . '/' . $file)) {
$arr[$file] = sdir($dir . '/' . $file);
} else {
$arr[] = $file;
}
}
}
closedir($handle);
return $arr;
}
}
}
//获取URL扩展名
pathinfo($url, PATHINFO_EXTENSION);
//多进程同时写入同一个文件
function writeFile($file, $content) {
$fp = fopen($file, 'w+');
if (flock($fp, LOCK_EX)) {
fwrite($fp, $content);
flock($fp, LOCK_UN);
}
fclose($fp);
}
//计算$p2相对$p1的路径
function relPath($p1, $p2) {
$arr1 = explode('/', dirname($p1));
$arr2 = explode('/', dirname($p2));
//判断第几层目录不同
for ($i = 0, $len = count($arr2); $i < $len; $i++) {
if ($arr1[$i] != $arr2[$i]) {
break;
}
}
//注意：$i++与++$i的不同
$i == 1 && $re = array();
$i != 1 && $i < $len && $re = array_fill(0, $len-$i, '..');
$i == $len && $re = array('./');
$re = array_merge($re, array_slice($arr1, $i));
return implode('/', $re);
}
//获取全路径脚本文件扩展名
$path = str_replace('\\', '/', __FILE__);
strrchr($path, '.');
substr($path, strrpos($path, '.'));
$p = pathinfo($path); $p['extension'];
$arr = explode('.', $path); $arr[count($arr)-1];
preg_replace('/^[^\.]+\.([\w]+)$/', '${1}', basename($path));