
批改狀態(tài):合格
老師批語:
// 1.array_count_values() 返回一個(gè)數(shù)組:數(shù)組的鍵是 array 里單元的值;數(shù)組的值是 array 單元的值出現(xiàn)的次數(shù)。
//返回一個(gè)關(guān)聯(lián)數(shù)組,用 array 數(shù)組中的值作為鍵名,該值在數(shù)組中出現(xiàn)的次數(shù)作為值。
$array = array(1, "hello", 1, "world", "hello");
print_r(array_count_values($array));
//count — 計(jì)算數(shù)組中的單元數(shù)目,或?qū)ο笾械膶傩詡€(gè)數(shù)
$a[0] = 1;
$a[1] = 3;
$a[2] = 5;
var_dump(count($a));
//合并
//array_merge( array $... = ?) : array 將一個(gè)或多個(gè)數(shù)組的單元合并起來,一個(gè)數(shù)組中的值附加在前一個(gè)數(shù)組的后面。返回作為結(jié)果的數(shù)組
//注意 鍵名相同后面會(huì)覆蓋前面的值
$array1 = array("color" => "red", 2, 4);
$array2 = array("a", "b", "color" => "green", "shape" => "trapezoid", 4);
$result = array_merge($array1, $array2);
print_r($result);
//array_intersect( array $array1, array $array2 , array $... = ?) : array 返回一個(gè)數(shù)組,該數(shù)組包含了所有在 array1 中也同時(shí)出現(xiàn)在所有其它參數(shù)數(shù)組中的值。注意鍵名保留不變
//array1 要檢查的數(shù)組,作為主值。 array2 要被對(duì)比的數(shù)組。
$array1 = array("a" => "green", "red", "blue");
$array2 = array("b" => "green", "yellow", "red");
$result = array_intersect($array1, $array2);
print_r($result);
// array_unique(數(shù)組名,排序規(guī)則) — 移除數(shù)組中重復(fù)的值
$input = array("a" => "green", "red", "b" => "green", "blue", "red");
$result = array_unique($input);
print_r($result);
//運(yùn)算
//array_sum() 將數(shù)組中的所有值相加,并返回結(jié)果。
$a = array(2, 4, 6, 8);
echo array_sum(($b));
//array_product() 以整數(shù)或浮點(diǎn)數(shù)返回一個(gè)數(shù)組中所有值的乘積。
$a = array(2, 4, 6, 8);
echo array_product($a);
//排序
// arsort(數(shù)組名,排序規(guī)則);對(duì)數(shù)組進(jìn)行逆向排序并保持索引關(guān)系
$fruits = array("d" => "lemon", "a" => "orange", "b" => "banana", "c" => "apple");
arsort($fruits);
foreach ($fruits as $key => $val) {
echo "$key = $val\n";
}
//asort — 對(duì)數(shù)組進(jìn)行排序并保持索引關(guān)系
$fruits = array("d" => "lemon", "a" => "orange", "b" => "banana", "c" => "apple");
asort($fruits);
foreach ($fruits as $key => $val) {
echo "$key = $val\n";
}
//krsort — 對(duì)數(shù)組按照鍵名逆向排序
$fruits = array("d"=>"lemon", "a"=>"orange", "b"=>"banana", "c"=>"apple");
krsort($fruits);
foreach ($fruits as $key => $val) {
echo "$key = $val\n";
}
//ksort — 對(duì)數(shù)組按照鍵名排序
$fruits = array("d"=>"lemon", "a"=>"orange", "b"=>"banana", "c"=>"apple");
ksort($fruits);
foreach ($fruits as $key => $val) {
echo "$key = $val\n";
}
//rsort — 對(duì)數(shù)組逆向排序
$fruits = array("lemon", "orange", "banana", "apple");
rsort($fruits);
foreach ($fruits as $key => $val) {
echo "$key = $val\n";
}
//sort — 對(duì)數(shù)組排序
$fruits = array("lemon", "orange", "banana", "apple");
sort($fruits);
foreach ($fruits as $key => $val) {
echo "$key = $val\n";
}
微信掃碼
關(guān)注PHP中文網(wǎng)服務(wù)號(hào)
QQ掃碼
加入技術(shù)交流群
Copyright 2014-2025 http://ipnx.cn/ All Rights Reserved | php.cn | 湘ICP備2023035733號(hào)