给两个字符串s和t，判断t是否为s的重新排列后组成的单词

<?php
# 1、给两个字符串s和t，判断t是否为s的重新排列后组成的单词
# s = "anagram",t="nagaram",return true
# s = "rat", t = "car", return false

function compare($s, $t)
{
    $dic1 = [];
    for ($i = 0; $i < strlen($s); $i++) {
        $name = $s[$i];
        $dic1[$name] = (isset($dic1[$name]) ? $dic1[$name] : 0) + 1; // 字母出现的次数
    }
    print_r($dic1);
    echo "\n";

    $dic2 = [];
    for ($i = 0; $i < strlen($t); $i++) {
        $name = $t[$i];
        $dic2[$name] = (isset($dic2[$name]) ? $dic2[$name] : 0) + 1; // 字母出现的次数
    }
    print_r($dic2);
    echo "\n";

    return $dic1 == $dic2 ? true : false;
}

$s = "anagram";
$t = "nagaram";
var_dump(compare($s, $t));
echo "\n";
$s = "rat";
$t = "car";
var_dump(compare($s, $t));
echo "\n";