更有效的方式合并两个阵列

我比较阵列的每个元素与阵列的每个其他元素，如果两个元素具有相同的源/目标，目标/源我合并内部阵列与员工例如更有效的方式合并两个阵列

0=> source - 3 target - 4 officers => 0 - 'Aberdeen Asset Management PLC' 
1=> source - 3 target - 4 officers => 0 - 'whatever'

将被合并到

0=> source - 3 target - 4 officers => 0 - 'Aberdeen Asset Management PLC', 1 - 'whatever'

下面是数据看起来的样子：

我的代码是1000更多的行要经过真正的低效执行需要大约90秒，这是不可接受的。

foreach ($edges as $i => &$edge) { 
     for ($j = $i + 1; $j < count($edges); $j++) { 
      if ($edge['source'] == $edges[$j]['source'] && $edge['target'] == $edges[$j]['target']) { 
       foreach ($edges[$j]['officers'] as $officer) { 
        array_push($edge['officers'], $officer); 
       } 
       array_splice($edges, $j, 1); 
      } 
     } 
    }

来源

2016-07-30 Higeath

我认为你应该这样做（更新）：

// we will have new array with officers 
$new_items = array(); 
foreach ($edges as $edge) { 
    // create unique keys for `source-target` and `target-source` pairs 
    $source_target = $edge['source'] . ':' . $edge['target']; 
    $target_source = $edge['target'] . ':' . $edge['source']; 

    // check if unique keys exists in `new_items` 
    if (!isset($new_items[$source_target]) && !isset($new_items[$target_source])) { 
     // if unique key doesn't exist - create a new one 
     $new_items[$source_target] = $edge; 
    } elseif (isset($new_items[$source_target])) { 
     // if unique key exists `$source_target` - add an officer to it 
     $new_items[$source_target]['officers'][] = $edge['officers'][0]; 
    } else { 
     // if unique key exists `$target_source` - add an officer to it 
     $new_items[$target_source]['officers'][] = $edge['officers'][0]; 
    } 
} 

// for returning to numeric indexes use `array_values` 
$new_items = array_values($new_items);

来源

2016-07-30 14:37:02

你不能自己解决你的问题？ –

@u_mulder好了，如果他告诉你**他需要什么，然后复制粘贴就会容易多了。毕竟，你这样做是免费的，因为你没有什么比做代码更好的做法，所以其他人可以从中获利，为什么不放纵所有愿望呢？ :) –

使用array_search，array_keys，array_slice和array_merge功能的解决方案：

// an exemplary array 
$edges = [ 
    0 => ['source' => 3, 'target' => 4, 'officers' => ['Aberdeen Asset Management PLC']], 
    1 => ['source' => 3, 'target' => 4, 'officers' => ['whatever']], 
    3 => ['source' => 4, 'target' => 7, 'officers' => ['Jason']], 
    4 => ['source' => 4, 'target' => 5, 'officers' => ['John']], 
    5 => ['source' => 4, 'target' => 7, 'officers' => ['Bourne']] 
]; 

foreach ($edges as $k => &$v) { 
    $next_slice = array_slice($edges, array_search($k, array_keys($edges)) + 1); 
    foreach ($next_slice as $key => $item) { 
     if ($item['source'] == $v['source'] && $item['target'] == $v['target']) { 
      $v['officers'] = array_merge($v['officers'], $item['officers']); 
      unset($edges[$k + $key + 1]); 
     } 
    } 
} 

print_r($edges);

DEMO link

来源

2016-07-30 15:29:57 RomanPerekhrest

更有效的方式合并两个阵列

回答

相关问题