2
这是我第一次参与列表,我是下面的问题,我有一个动态查询,将永远返回一个数组与n个元素,如下面的例子:从坐标(php)
Array ( [0] => Array ( [gid] => 311 [length] => 408.804653251745 [start_point] => POINT(261675 9196115) [end_point] => POINT(261977.5 9196357.5) ) [1] => Array ( [gid] => 312 [length] => 4304.33549546129 [start_point] => POINT(259885 9193105) [end_point] => POINT(261675 9196115) ) [2] => Array ( [gid] => 313 [length] => 7470.68109219034 [start_point] => POINT(262855 9190095) [end_point] => POINT(261675 9196115) ) [3] => Array ( [gid] => 314 [length] => 1926.81240867132 [start_point] => POINT(264465 9190755) [end_point] => POINT(262855 9190095) ) [4] => Array ( [gid] => 315 [length] => 1828.52813742386 [start_point] => POINT(264215 9189275) [end_point] => POINT(262855 9190095) ) )
我需要创建一个函数来分析数组,比较start_points和end_points。如果他们元素相等,长度被累积到一个新的数组,像这样:
Array ( [0] => Array ( [river_1] => "311" [total_length] => 408.804653251745 ) [1] => Array ( [river_2] => "311,312" [total_length] => 4713.140148713 ) [2] => Array ( [river_3] => "311,313" [total_length] => 7879.485745442 ) [3] => Array ( [river_4] => "311,313,314" [total_length] => 9806.298154113 ) [4] => Array ( [river_5] => "311,313,315" [total_length] => 9708.013882866 ) )
我感兴趣的是最长的长度(river_4)的河流,请注意,从坐标通知,我可以谱写5河流。见图片:https://picasaweb.google.com/benigno.marcello/Duvida?feat=directlink。阵列的河流呈黄色(在分水岭中)。任何人都可以帮助我?
由于提前,