1 回答

TA貢獻(xiàn)1827條經(jīng)驗(yàn) 獲得超9個(gè)贊
使用array_walk()對(duì)數(shù)組進(jìn)行迭代。在迭代檢查天氣的每個(gè)循環(huán)中,鍵已經(jīng)存在于$res數(shù)組中。如果存在,則創(chuàng)建與舊值合并的數(shù)組并分配給相同的鍵。如果不存在鍵,則將 分配$val給$res數(shù)組。
$data = array("1536" => "12","1695" => "Korea","1904" => "10/7","1905" => "", "1906" => null,"1907" => "1.1","1906.1" => "H1","1906.2" => "H35","1905.1" => "15");
$res = array();
array_walk($data, function($val, $key) use(&$res) {
$key = intval($key);
if (array_key_exists($key, $res)) {
$res[$key] = is_array($res[$key]) ? array_merge($res[$key], [$val]) : array_merge([$res[$key]], [$val]);
} else {
$res[$key] = $val;
}
});
print_r($res);
- 1 回答
- 0 關(guān)注
- 155 瀏覽
添加回答
舉報(bào)