递归算法学习

<?php
$arr = [
    "Name"  => ‘test‘,
   "Data"  => [
            "Uid"   => 1,
            "Name"  => "eva",
            "Thread" => [
                "ID1"   => 22,
                "ID2"   => 33,
                ],
        ],
    "Title" => "get a string",
]; 
$testobj = new test();
$testobj->lower($arr);

$prefix = "";
$newArr = [];
$testobj->getPrefix($arr,$prefix,$newArr);
ksort($newArr);
$finalStr = "";
foreach ($newArr as $key=>$value){
    $finalStr .= $key."=".$value."&";
}
var_dump(rtrim($finalStr,"&"));
class test{
   
    function getPrefix($arr,&$prefix,&$newArr){
        foreach ($arr as $key=>$value){
            if(is_array($value)){
                $prefix .=$key.".";
                self::getPrefix($value,$prefix,$newArr);
                $prefix = "";
            }else{
                $newArr[$prefix.$key]=$value;
            }
            
        }
        
    }
   
    function lower(&$arr){
        $arr = array_change_key_case($arr);
        foreach ($arr as $key=>&$value){
            if(is_array($value)){
                self::lower($value);
            }
            
        }
    }
}
?>

<?php
    var_dump(discountAmount(800));
    //$amount 为原价
    function discountAmount($amount){
　　　　//价格 => 折扣
        $arr = [
            10 =>1000,　　
            100=> 999,
            200=>998,
            300=>997,
            400=>996,
            500=>995,
            600=>994,
            700=> 993,
            800=> 992,
            900=>991,
            1000=> 990,
            10000=> 989,
            50000=>988,
            500000=> 987,
    ];
    krsort($arr);
    foreach ($arr as $min=>$discount){
        if($amount>=$min){
            return $dicountAmount = $amount * $discount /1000;
        }
    }
    
    }
    
    
?>