约瑟夫环---栈

<?php
class ArrayStack
{
    private $size;
    private $stack = [];

    public function __construct(){}

    public function buildStack($num){
        $this->size = $num;
        $index = 0;
        while($index ++ < $this->size)
        {
            $this->stack[] = $index;
        }
    }

    public function pop(){
        $item = array_shift($this->stack);
        $this->size = count($this->stack);
        return $item;
    }

    public function push($item)
    {
        $this->stack[] = $item;
        $this->size = count($this->stack);
    }

    public function size()
    {
        return $this->size;
    }

    public function stack()
    {
        print_r($this->stack);
    }
}

interface Joseph
{
    public function handle($num, $step);
}

class StackJoseph implements Joseph
{
    protected $stack;
    protected $num;
    protected $step;


    public function __construct(ArrayStack $stack)
    {
        $this->stack = $stack;
    }

    public function handle($num, $step)
    {
        // TODO: Implement handle() method.
        $this->stack->buildStack($num);

        $i = 0;
        $this->stack->stack();
        while($this->stack->size() > 1)
        {
            $pop = $this->stack->pop();
            if(($i + 1) % $step !== 0)
            {
                $this->stack->push($pop);
            }
            $i ++;
        }
        $this->stack->stack();
        return $this->stack->pop();
    }
}



function joseph($num, $step)
{
    $arrayStack = new ArrayStack();
    $joseph = new StackJoseph($arrayStack);
    $survivor = $joseph->handle($num, $step);
    echo "survivor: $survivor\n";
}
joseph(6, 3);