<?php
// 数组去重后
sortUnique();
function sortUnique(){
$arr = [
'1' => '真难',
'12' => '真难2',
'13' => '真难',
'11' => '真难1',
'2' => '真难',
'4' => '真难1',
'54' => '真难',
'3' => '真难2',
'31' => '真难',
'61' => '真难3',
'5' => '真难',
];
$n = array_unique($arr);
var_dump($n); // array(4) { [1]=> string(6) "真难" [12]=> string(7) "真难2" [11]=> string(7) "真难1" [61]=> string(7) "真难3" }
echo "<br />";
sort($n);
var_dump($n); // 正序 array(4) { [1]=> string(6) "真难" [12]=> string(7) "真难2" [11]=> string(7) "真难1" [61]=> string(7) "真难3" }
echo "<br />";
$m = array_unique($arr);
rsort($m);
var_dump($m); // 倒叙 array(4) { [0]=> string(7) "真难3" [1]=> string(7) "真难2" [2]=> string(7) "真难1" [3]=> string(6) "真难" }
return $arr;
}
?>
php 数组去重后并进行健名重新排序 array_unique() sort() rsort()
最新推荐文章于 2023-08-29 11:00:47 发布