PHP 实现：最大化图的边端点权重和

<?php

function solution(int $N, array $A, array $B): int
{
    if (count($A) != count($B) || !is_int($N)) {
        return 0; // Or throw an exception, depending on the desired behavior
    }

    $vertextCount = [];
    foreach ($A as $val) {
        if (!isset($vertextCount[$val])) {
            $vertextCount[$val] = 0;
        }
        $vertextCount[$val]++;
    }

    foreach ($B as $val) {
        if (!isset($vertextCount[$val])) {
            $vertextCount[$val] = 0;
        }
        $vertextCount[$val]++;
    }

    if (count($vertextCount) < $N) {
        for ($i = 1; $i <= $N; $i++) {
            if (!isset($vertextCount[$i])) {
                $vertextCount[$i] = 0;
            }
        }
    }


    $wightArr = [];
    $vertices = array_keys($vertextCount);
    rsort($vertextCount); // Sort vertex counts in descending order

    $weight = $N;
    foreach ($vertextCount as $key => $count) {
        // Find the vertex with this count
        $vertex = array_search($count, array_count_values(array_keys($vertextCount)));
        if($vertex !== false){
            $wightArr[$vertices[$key]] = $weight;
            $weight--;
        }
    }

    $sum = 0;
    foreach ($A as $k => $val) {
        $sum += $wightArr[$A[$k]] + $wightArr[$B[$k]];
    }
    return $sum;
}

// Example usage:
$N = 5;
$A = [2, 2, 1, 2];
$B = [1, 3, 4, 4];

echo "Maximum sum: " . solution($N, $A, $B) . PHP_EOL;


$N = 4;
$A = [1, 2, 3, 4];
$B = [2, 3, 4, 1];

echo "Maximum sum: " . solution($N, $A, $B) . PHP_EOL;
?>