function Dijkstra(Graph, source):



    dist[source] ← 0          // Distance from source to source

    prev[source] ← undefined  // Previous node in optimal path initialization



    for each vertex v in Graph:  // Initialization

        if v ≠ source            // Where v has not yet been removed from Q (unvisited nodes)

            dist[v] ← infinity   // Unknown distance function from source to v

            prev[v] ← undefined  // Previous node in optimal path from source

        end if 

        add v to Q               // All nodes initially in Q (unvisited nodes)

    end for

    

    while Q is not empty:

        u ← vertex in Q with min dist[u]  // Source node in first case

        remove u from Q 

        

        for each neighbor v of u:         // where v has not yet been removed from Q.

            alt ← dist[u] + length(u, v)

            if alt < dist[v]:             // A shorter path to v has been found

                dist[v] ← alt 

                prev[v] ← u 

            end if

        end for

    end while



    return dist, prev



end function[/u][/u]

[u][u]sptSet = {false, false, false, false, false, false, false, false, false};

distSet = {0, INF, INF, INF, INF, INF, INF, INF, INF};[/u][/u]

[u][u]sptSet = {true, false, false, false, false, false, false, false, false};[/u][/u]

[u][u]distSet = {0, 4, INF, INF, INF, INF, INF, 8, INF};[/u][/u]

[u]

 
选择不在 sptSet 中的 Min Distance 的顶点，为顶点 1，则将 1 包含至 sptSet；

[u][u]sptSet = {true, true, false, false, false, false, false, false, false};[/u][/u]

[u][u]distSet = {0, 4, 12, INF, INF, INF, INF, 8, INF};[/u][/u]

[u]

 
选择不在 sptSet 中的 Min Distance 的顶点，为顶点 7，则将 7 包含至 sptSet；

[u][u]sptSet = {true, true, false, false, false, false, false, true, false};[/u][/u]

[u][u]distSet = {0, 4, 12, INF, INF, INF, 9, 8, 15};[/u][/u]

[u]

 
选择不在 sptSet 中的 Min Distance 的顶点，为顶点 6，则将 6 包含至 sptSet；

[u][u]sptSet = {true, true, false, false, false, false, true, true, false};[/u][/u]

[u][u]distSet = {0, 4, 12, INF, INF, 11, 9, 8, 15};[/u][/u]

[u]

 
以此类推，直到遍历结束。

[u][u]sptSet = {true, true, true, true, true, true, true, true, true};

distSet = {0, 4, 12, 19, 21, 11, 9, 8, 14};[/u][/u]

[u]

 
最终结果为源顶点 0 至所有顶点的距离：

[u][u]Vertex   Distance from Source

0                0

1                4

2                12

3                19

4                21

5                11

6                9

7                8

8                14[/u][/u]

<?php

/**

 * Class Road

 * 两点间最短路径计算类

 * User: 郑凯

 * Date: 2017/12/2

 * Time: 19:48

 * Dijkstra 算法，迪科斯彻算法（Dijkstra），又称为单源最短路径算法。

 * Dijstra算法是运用贪心的策略，从源点开始，不断地通过相联通的点找出到其他点的最短距离。

 */



class Road {



    //节点对应的字母名

    public $pointName = array(

        0 => "A",

        1 => "B",

        2 => "C",

        3 => "D",

        4 => "E",

        5 => "F",

        6 => "G",

        7 => "H",



    );



    //地图上的点已经点之间的路径长度

    public $points = array(

        "A" => array(

            "A" => 0,

            "B" => 15,

            "C" => 6,

            "D" => 0,

            "E" =>0,

            "F" =>25,

            "G" =>0,

            "H" =>0

        ),

        "B" => array(

            "A" => 15,

            "B" => 0,

            "C" => 9,

            "D" => 0,

            "E" =>7,

            "F" =>0,

            "G" =>0,

            "H" =>0

        ),

        "C" => array(

            "A" => 6,

            "B" => 9,

            "C" => 0,

            "D" => 11,

            "E" =>0,

            "F" =>0,

            "G" =>0,

            "H" =>0

        ),

        "D" => array(

            "A" => 0,

            "B" => 0,

            "C" => 11,

            "D" => 0,

            "E" =>12,

            "F" =>0,

            "G" =>0,

            "H" =>5

        ),

        "E" => array(

            "A" => 0,

            "B" => 7,

            "C" => 0,

            "D" => 12,

            "E" =>0,

            "F" =>5,

            "G" =>0,

            "H" =>7

        ),

        "F" => array(

            "A" => 25,

            "B" => 0,

            "C" => 0,

            "D" => 0,

            "E" =>5,

            "F" =>0,

            "G" =>12,

            "H" =>0

        ),

        "G" => array(

            "A" => 0,

            "B" => 0,

            "C" => 0,

            "D" => 0,

            "E" =>0,

            "F" =>12,

            "G" =>0,

            "H" =>17

        ),

        "H" => array(

            "A" => 0,

            "B" => 0,

            "C" => 0,

            "D" => 5,

            "E" =>7,

            "F" =>0,

            "G" =>17,

            "H" =>0

        ),

    );



    //有向图存储

    private $graph = array(

        array(0,15,6,0,0,25,0,0),

        array(15,0,9,0,7,0,0,0),

        array(6,9,0,11,0,0,0,0),

        array(0,0,11,0,12,0,0,5),

        array(0,7,6,12,0,5,0,7),

        array(25,0,6,0,5,0,12,0),

        array(0,0,0,0,0,12,0,17),

        array(0,0,0,5,7,25,17,0)

    );



    //设置一个无穷大距离的数字

    private $soBig = 999999;



    private $path = array();





    private function getOptimalPath($a, $b)

    {



        if($a == $b){

            return "start and end could not be one point";

        }





        //读取已经选择的点

        $idx = array_keys($this->points);

        $a = array_search($a, $idx);

        $b = array_search($b, $idx);



        //存储路径上节点距离$a点的最小距离

        $c = array();

        $path = array();



        //初始化距离起点最近的节点的最小距离

        for($i=1;$i<8;$i++)

        {

            if($this->graph[$a][$i]>0)

            {

                $c[$i] = $this->graph[$a][$i];

                $path[$i]['name'] = $this->pointName[$a];

                $path[$i]['key'] = $a;

            }

            else

            {

                $c[$i] = $this->soBig;

            }

        }



        //用于存储已经选择的节点

        $selected = array($a);

        $all = array(1,2,3,4,5,6,7);

        unset($all[$a-1]);

        $others = $all;



       // n-1次循环完成转移节点任务

        for($i=0;$i<count($this->graph)-1;$i++)

        {

            //查找剩余节点中距离起点最近的节点v

            $current_min = $this->soBig;

            $current_min_v = 0;

            foreach($others as $k=>$v)

            {

                if($c[$v] < $current_min)

                {



                    $current_min = $c[$v];

                    $current_min_v = $v;

                }

            }













            //从$others更新顶点到$selected中

            array_push($selected,$current_min_v);

            array_splice($others,array_search($current_min_v,$others),1);





            //更新最短路径

            foreach($others as $k=>$u)

            {



                if($this->graph[$current_min_v][$u]!=0&&$c[$u]>$c[$current_min_v]+$this->graph[$current_min_v][$u])

                {



                    $path[$u]['name'] = $this->pointName[$current_min_v];

                    $path[$u]['key'] = $current_min_v;

                    $c[$u] = $c[$current_min_v]+$this->graph[$current_min_v][$u];



                }

            }











        }



        $this->getRoadLine($path,$b,$a);

        $finalPath = $this->pointName[$a];

        foreach(array_reverse($this->path) as $x => $y){

            $finalPath.=$y;

        }

        $finalPath.=$this->pointName[$b];



        return $c[$b]." ".$finalPath;

    }





    //获取路径信息

    public function getRoadLine($path,$b,$a)

    {

        if($path[$b]['key'] !== $a){

            $this->path = $path[$b]['name'];

            $this->getRoadLine($path,$path[$b]['key'],$a);

        }



    }



    public function getResult($towPoint){



        return $this->getOptimalPath(substr($towPoint,0,1),substr($towPoint, -1));



    }





}



//获取输入变量

$params = trim(fgets(STDIN), " \t\n\r\0\x0B");

$road = new Road();

echo $road->getResult($params);

<?php

/**

 * Created by PhpStorm.

 * User: ZKBHJ

 * Date: 2017/12/2

 * Time: 18:14

 */



class Summer {



    //小朋友总数

    public $childCounts = 1314;



    //小朋友围成的圈儿

    public $childCircle = array();



    //指定的随机数

    public $e = 520;





    //初始化围成一个圈儿

    private function initCircle()

    {



        for($i = 0; $i< $this->childCounts; $i++){

            $this->childCircle[$i] = $i;

        }

    }





    private function findChild()

    {



        $index = 0;

        for ($i = 2; $i <= $this->childCounts; $i ++) {

            $index = ($index + $this->e) % $i;

        }

        return $index;



    }



    public function getResult()

    {

        $this->initCircle();

        return $this->findChild();

    }



}



//获取输入变量

$params = explode(' ', trim(fgets(STDIN), " \t\n\r\0\x0B[]"));

foreach($params as $k => $v){

    $params[$k] = explode('=',$v);

}



$summer = new Summer();

$summer->childCounts = $params[0][1];

$summer->e = $params[1][1];

echo $summer->getResult();

<?php

/**

 * Class ServiceOrder

 * 服务师傅订单最优分配计算

 * User: 郑凯

 * Date: 2017/12/2

 * Time: 18:13

 */



class ServiceOrder {



    //待分配的订单数组

    public $orderList = array();



    //服务师傅每天的工作时长

    public $workTime = 8;



    //最终筛选出来的收益最大订单列表

    public $finalOrderList = array();







    //按照预设好的格式，将数据进行初始化，装填到数组中

    public function initOrder($orderList)

    {



        //去除前后多余的[]

        $orderList = substr($orderList, 1);

        $orderList = substr($orderList, 0, -1);



        $tempArray = explode(",",$orderList);

        foreach($tempArray as $key => $value){

            $this->orderList[$key] = explode(" ",$value);

        }



    }



    function arraySequence($array, $field, $sort = 'SORT_DESC')

    {

        $arrSort = array();

        foreach ($array as $uniqid => $row) {

            foreach ($row as $key => $value) {

                $arrSort[$key][$uniqid] = $value;

            }

        }

        array_multisort($arrSort[$field], constant($sort), $array);

        return $array;

    }



    //给师傅按最大收益安排订单

    public function planOrder()

    {



        //计算每个订单的平均赚取收益

        foreach($this->orderList as $key => $value){

            $this->orderList[$key][3] = $value[2]/$value[1];

        }



        //将订单按照平均赚取收益由高到低排序

        $this->orderList = $this->arraySequence($this->orderList,'3','SORT_DESC');



        //按照每日工作时长限制，取收益率最高的头几个订单

        $workTime = 0;

        foreach($this->orderList as $k => $v){

            if($this->workTime - $workTime >= $v[1]){

                $this->finalOrderList[] = $v;

                $workTime+=$v[1];

            }



        }



    }



    public function printOrder()

    {



        //输出总收益

        $string = array_sum(array_map(create_function('$val', 'return $val["2"];'), $this->finalOrderList))." ";



        //输出订单编号（按单笔订单收益由高到低排序，相同的，则按照平均赚取收益由高到低排序）

        foreach($this->finalOrderList as $k => $v){

            $total[$k] = $v[2];

            $average[$k] = $v[3];

        }

        array_multisort($total, SORT_DESC, $average, SORT_DESC, $this->finalOrderList);



        //输出订单号

        foreach($this->finalOrderList as $k => $v){

            $string .= $v[0]." ";

        }



        return $string;



    }



    public function getResult()

    {

        $this->planOrder();

        return $this->printOrder();

    }







}





//获取输入变量

$orderList = trim(fgets(STDIN), " \t\n\r\0\x0B");



$service = new ServiceOrder();

$service->initOrder($orderList);

echo $service->getResult();

<?php

/**

 * Class Pool

 * 蓄水池蓄水量计算类

 * User: 郑凯

 * Date: 2017/12/2

 * Time: 15:35

 */



class WaterPool {



    //水池数组(二维数组)

    public $poolArray = array();

    //水池中凹的地方的数量

    public $aoCounts = 0;

    //水池中木桶效应的最低“短板”数量（决定单个凹的地方的储水量）

    public $bottomCounts = 0;





    private function getWater()

    {



        //遍历水池数组(二维数组)

        $bottomTemp = array("height"=>9,"counts"=>0);

        foreach($this->poolArray as $key => $value){



            foreach($value as $k => $v){



                //统计水池中凹的地方的数量

                if($v == 0){

                    $this->aoCounts++;

                }



                //统计水池中木桶效应的最低“短板”数量

                if($bottomTemp["height"] > $v && $v != 0){

                    $bottomTemp["height"] = $v;

                    $bottomTemp["counts"] = 1;



                }elseif($bottomTemp["height"] == $v){

                    $bottomTemp["counts"]++;

                }



            }



        }



        //计算水池中的最多储水量

        return $this->aoCounts * $bottomTemp["height"];



    }



    //得到结果

    public function getResult()

    {

        return $this->getWater();

    }



}



//获取输入变量

$params = explode(',', trim(fgets(STDIN), " \t\n\r\0\x0B"));

foreach($params as $k => $v){

    $params[$k] = explode(' ',$v);

}



//实例化

$pool = new WaterPool();

$pool->poolArray = $params;

echo $pool->getResult();

<?php

/**

 * Class Max

 * 计算最大数字

 * User: 郑凯

 * Date: 2017/12/2

 * Time: 14:02

 */



class Max {



    //要进行处理的原始数字数组

    public $numbers = array();

    //经过处理后排序好的数字数组

    public $lastNumber = array();





    /**

     * 获取整数某个位置的数字值

     * @param $number

     * @param int $position

     * @return bool

     */

    public function getPositionNumber($number,$position = 0)

    {

        //将数字当成字符串，将数字分离个位数存到数组中

        for($i=0;$i<strlen($number);$i++){

            $array[] = substr($number,$i,1);

        }

        return isset($array[$position])?$array[$position]:false;

    }





    /**

     * 比较两个数，决定谁优先排在前面（即下面注释中的“最大数”）

     * @param $a

     * @param $b

     * @return null

     */

    private function compare($a,$b){



        //默认最大值是null

        $max = null;



        //按两个数中数学概念中的最小数的长度进行从高到低每一位数字的对比

        for($i = 0; $i<min(array(strlen($a),strlen($b))); $i++){



            //如果同一位上的两个数字相等，则继续向下一位比较

            if($this->getPositionNumber($a, $i) == $this->getPositionNumber($b, $i)){

                continue;

            }else{



                //如果两个数字不等，则“最大数”是比较大的那个整数，跳出循环，不再继续比较

                $this->getPositionNumber($a, $i) > $this->getPositionNumber($b, $i) ? $max = $a:$max = $b;

                break;

            }

        }



        //如果走到这里，说明数学概念中最小数的长度的头几位两个整数一样，那么就需要比较较长数字的下一位和较短数字的第一位

        //首先判断这两个整数中哪个是短的

        //如果两个整数长度一致，说明两个整数一样，则返回谁都可以

        //如果较长数字的下一位比较短整数的第一位大，则“最大数”应该是前者，否则，应该是后者

        if($max == null){

            if(strlen($a)<strlen($b)){

                $this->getPositionNumber($b, $i) > $this->getPositionNumber($a,0) ? $max = $b:$max = $a;

            }elseif(strlen($a)>strlen($b)){



                $this->getPositionNumber($a, $i) > $this->getPositionNumber($b,0) ? $max = $a:$max = $b;

            }else{

                $max = $a;

            }

        }



        //返回“最大数”

        return $max;

    }





    //主体函数，获取最大数字

    public function getMaxNumber()

    {



        //初始化最大数，赋值为给定数字数组中的第一个

        $max = array("key"=> 0, "value"=>$this->numbers[0]);



        //对数组中的每个数字进行循环，将其与Max中的数字进行比较

        for($j=0 ;$j < count($this->numbers); $j++){



            $tempMax = $this->compare($this->numbers[$j],$max['value']);



            //如果得到的“最大数”应不是原来的“最大数”，那么进行最大数的更新（更新key和value），这里的key主要用于下面的unset

            if($tempMax != $max['value']){

                $max['value'] = $tempMax;

                $max['key'] = $j;

            }

        }



        //把这一轮比较中的“最大数”放入数组中

        $this->lastNumber[] = $max;

        //将这个比较出来的“最大数”从原始数组中删除，不再让他捣乱啦

        unset($this->numbers[$max['key']]);

        //将原始数组重建key

        $this->numbers = array_values($this->numbers);

        //如果原始数组中还有数组，继续递归调用

        if(count($this->numbers) > 0){

            $this->getMaxNumber();

        }





    }



    //输出最后连起来最大的数字

    public function getResult()

    {



        $this->getMaxNumber();

        foreach($this->lastNumber as $key => $value){

            echo $value['value'];

        }

    }

}



//获取输入变量

$numbers = explode(',', trim(fgets(STDIN), " \t\n\r\0\x0B[]"));



//实例化

$max = new Max();

$max->numbers = $numbers;

$max->getResult();

<?php



class Fire {



    private $numberItems = array();



    //用于存储所有可能的情况

    private $situation = array();



    //设计的最终结果

    private $result = 110;



    //用于存储计算结果和设计结果一直的情况

    private $rightSituation = array();



    //用0,1,2分别代表空格、加号和减号

    private $symbol = array(0=>"",1=>"+",2=>"-");



    private $temp = array();





    //获取所有可能出现的情况

    public function getSituation($index)

    {



        if ($index == 8) {

            $this->situation[] = $this->temp;

            return;

        }

        //每个空有三种可能，0,1,2

        for ($i = 0; $i < 3; $i++) {

            $this->temp[$index] = $i;

            $this->getSituation($index + 1);

            $this->temp[$index] = 0; //恢复原来的状态

        }

    }



    //获得表达式和输出结果

    public function calculate()

    {



        foreach($this->situation as $k => $v){

            $number = 1;

            $expression = 1;

            foreach($v as $key => $value){



                switch($value)

                {

                    //空格

                    case 0:

                    {

                        $expression = $expression.$this->numberItems[$key+1];

                        break;

                    }

                    //加号

                    case 1:

                    {

                        $expression = $expression . "+" .$this->numberItems[$key+1];

                        break;

                    }

                    //减号

                    case 2:

                    {

                        $expression = $expression . "-" .$this->numberItems[$key+1];

                        break;

                    }

                }

            }



            //判断是否等于预期结果

            $expressionResult = $this->getExpressionResult($expression);



            if($this->result == $expressionResult){

                echo $expression . " = ". $expressionResult, PHP_EOL;

            }





        }



    }



    //根据字符串表达式计算结果

    public function getExpressionResult($expression)

    {



        //将加减符号进行分解排序

        $all = str_split($expression,1);

        $flag_reduce = array_keys($all,'-');

        $flag_add = array_keys($all,'+');

        $flags = array_merge($flag_add,$flag_reduce);

        asort($flags);



        foreach($flags as $key => $value){

            array_search($value,$flag_reduce) === false ? $flags[$key] = "+":$flags[$key] = "-";

        }



        //重建key

        $flags = array_values($flags);



        //按顺序获得运算数

        $expression_reduce = str_replace("+","-",$expression);

        $array_numbers = explode('-',$expression_reduce);



        //逐个数字进行运算

        $result = 0;

        foreach($array_numbers as $k => $v){



            if($k == 0){

                $result = $v;

                continue;

            }



            $flag = isset($flags[$k-1])?$flags[$k-1]:"";

            switch($flag){

                case "+":

                {

                    $result = $result + $v;

                    break;

                }

                case "-":

                {



                    $result = $result - $v;

                    break;

                }

                case "":

                {

                    break;

                }



            }



        }



        return $result;



    }





    public function getResult($base)

    {

        $this->numberItems = $base;

        $this->getSituation(0);

        $this->calculate();

    }

}



//获取输入变量

$base = explode(' ', trim(fgets(STDIN), " \t\n\r\0\x0B[]"));

$fire = new Fire();

$fire->getResult($base);

<?php



/**

 * Class Money

 * 租金卡张数计算类

 * User: 郑凯

 * Date: 2017/12/2

 * Time: 12:15

 */

class Money {



    //租金卡总金额

    public $totalValue;



    //租金卡面额列表

    public $couponList = array(1000=>0,500=>0,100=>0,50=>0,20=>0,10=>0,5=>0,1=>0);



    //算法主体，计算当前金额中可以整租的最大基础面额，并计数

    private function getMaxValue($money)

    {



        //按基础面额从高到低依次循环，如果能够被当前金额“整除”，则计算张数并递归

        //当金额最后为0时，结束循环，完成计算

        foreach ($this->couponList as $key => $value){

            if($money / $key >= 1 && $money > 0){

                //对应金额数组的个数增加

                $this->couponList[$key] = floor($money / $key);

                //更新下次计算金额

                $money-=$key*floor($money / $key);

                //递归调用

                $this->getMaxValue($money);

            }

        }



    }



    //获取完整列表结果

    public function getResult()

    {

        //调用计算函数进行计算

        $this->getMaxValue($this->totalValue);



        //输出结果

        echo "当总金额为 ".$this->totalValue." 时，需要";

        foreach ($this->couponList as $key => $value){

            if($value > 0){

                echo $value . "张面额为 ".$key." 元的租金卡, ";

            }

        }

        echo "总计 ".array_sum($this->couponList)." 张！";

    }



    //获取总张数

    public function getTotalCounts()

    {

        return array_sum($this->couponList);

    }

}



//获取输入变量

$params = trim(fgets(STDIN), " \t\n\r\0\x0B[]");

//实例化类并初始化类

$myCoupon = new Money();

$myCoupon->totalValue = $params;

$myCoupon->getResult();

//\n是为了让输出结果在anycodes.cn的输出界面可以换行

echo "\n" . $myCoupon->getTotalCounts();

“php://input allows you to read raw POST data. It is a less memory intensive alternative to $HTTP_RAW_POST_DATA and does not need any special php.ini directives. php://input is not available with enctype=”multipart/form-data”.

“php://input可以读取没有处理过的POST数据。相较于$HTTP_RAW_POST_DATA而言，它给内存带来的压力较小，并且不需要特殊的php.ini设置。php://input不能用于enctype=multipart/form-data”

1. 读取POST数据
2. 不能用于multipart/form-data类型
3. php://input VS $HTTP_RAW_POST_DATA

@file 192.168.0.6:/phpinput_server.php 打印出接收到的数据



@file 192.168.0.8:/phpinput_post.php 模拟以POST方法提交表单数据



@file 192.168.0.8:/phpinput_xmlrpc.php 模拟以POST方法发出xmlrpc请求.



@file 192.168.0.8:/phpinput_get.php 模拟以GET方法提交表单表数

//@file phpinput_server.php

$raw_post_data = file_get_contents('php://input', 'r');

echo "-------\$_POST------------------\n";

echo var_dump($_POST) . "\n";

echo "-------php://input-------------\n";

echo $raw_post_data . "\n";

//@file phpinput_post.php

$http_entity_body = 'n=' . urldecode('perfgeeks') . '&p=' . urldecode('7788');

$http_entity_type = 'application/x-www-form-urlencoded';

$http_entity_length = strlen($http_entity_body);

$host = '192.168.0.6';

$port = 80;

$path = '/phpinput_server.php';

$fp = fsockopen($host, $port, $error_no, $error_desc, 30);

if ($fp) {

  fputs($fp, "POST {$path} HTTP/1.1\r\n");

  fputs($fp, "Host: {$host}\r\n");

  fputs($fp, "Content-Type: {$http_entity_type}\r\n");

  fputs($fp, "Content-Length: {$http_entity_length}\r\n");

  fputs($fp, "Connection: close\r\n\r\n");

  fputs($fp, $http_entity_body . "\r\n\r\n");

 

  while (!feof($fp)) {

    $d .= fgets($fp, 4096);

  }

  fclose($fp);

  echo $d;

}

@php /phpinput_post.php

HTTP/1.1 200 OK

Date: Thu, 08 Apr 2010 03:23:36 GMT

Server: Apache/2.2.3 (CentOS)

X-Powered-By: PHP/5.1.6

Content-Length: 160

Connection: close

Content-Type: text/html; charset=UTF-8

-------$_POST------------------

array(2) {

  ["n"]=> string(9) "perfgeeks"

  ["p"]=> string(4) "7788"

}

-------php://input-------------

n=perfgeeks&p=7788

  192.168.0.8:57846 -> 192.168.0.6:80 [AP]

  POST /phpinput_server.php HTTP/1.1..

  Host: 192.168.0.6..Content-Type: application/x-www-form-urlencoded..Co

  ntent-Length: 18..Connection: close....n=perfgeeks&p=7788....

1. $_POST数据，php://input 数据与httpd entity body数据是“一致”的。
2. http请求中的Content-Type是application/x-www-form-urlencoded ，它表示http请求body中的数据是使用http的post方法提交的表单数据，并且进行了urlencode()处理。

//@file phpinput_xmlrpc.php

$http_entity_body = "\n\n   jt_userinfo\n";

$http_entity_type = 'text/html';

$http_entity_length = strlen($http_entity_body);

$host = '192.168.0.6';

$port = 80;

$path = '/phpinput_server.php';

$fp = fsockopen($host, $port, $error_no, $error_desc, 30);

if ($fp) {

  fputs($fp, "POST {$path} HTTP/1.1\r\n");

  fputs($fp, "Host: {$host}\r\n");

  fputs($fp, "Content-Type: {$http_entity_type}\r\n");

  fputs($fp, "Content-Length: {$http_entity_length}\r\n");

  fputs($fp, "Connection: close\r\n\r\n");

  fputs($fp, $http_entity_body . "\r\n\r\n");

  while (!feof($fp)) {

    $d .= fgets($fp, 4096);

  }

 

  fclose($fp);

  echo $d;

}

@php /phpinput_xmlrcp.php

HTTP/1.1 200 OK

Date: Thu, 08 Apr 2010 03:47:18 GMT

Server: Apache/2.2.3 (CentOS)

X-Powered-By: PHP/5.1.6

Content-Length: 154

Connection: close

Content-Type: text/html; charset=UTF-8



-------$_POST------------------

array(0) {

}



-------php://input-------------

<?xml version="1.0">

<methodcall>

   <name>jt_userinfo</name>

</methodcall>

T 192.168.0.8:45570 -> 192.168.0.6:80 [AP]

  POST /phpinput_server.php HTTP/1.1..

  Host: 192.168.0.6..Content-Type: text/html..Content-Length: 75..Connec

  tion: close....<?xml version="1.0">.<methodcall>.   <name>jt_userinfo<

  /name>.</methodcall>....

1. http请求中的Content-Type是text/xml。它表示http请求中的body数据是xml数据格式。
2. 服务端$_POST打印出来的是一个空数组，即与http entity body不一致了。这跟上个例子不一样了，这里的Content-Type是text/xml,而不是application/x-www-form-urlencoded
3. 而php://input数据还是跟http entity body数据一致。也就是php://input数据和$_POST数据不一致了。

//@file phpinput_server.php

$raw_post_data = file_get_contents('php://input', 'r');

echo "-------\$_GET------------------\n";

echo var_dump($_GET) . "\n";

echo "-------php://input-------------\n";

echo $raw_post_data . "\n";

//@file phpinput_get.php

$query_path = 'n=' . urldecode('perfgeeks') . '&p=' . urldecode('7788');

$host = '192.168.0.6';

$port = 80;

$path = '/phpinput_server.php';

$d = '';

$fp = fsockopen($host, $port, $error_no, $error_desc, 30);

if ($fp) {

  fputs($fp, "GET {$path}?{$query_path} HTTP/1.1\r\n");

  fputs($fp, "Host: {$host}\r\n");

  fputs($fp, "Connection: close\r\n\r\n");

 

  while (!feof($fp)) {

    $d .= fgets($fp, 4096);

  }

  fclose($fp);

  echo $d;

 }

@php /phpinput_get.php

HTTP/1.1 200 OK

Date: Thu, 08 Apr 2010 07:38:15 GMT

Server: Apache/2.2.3 (CentOS)

X-Powered-By: PHP/5.1.6

Content-Length: 141

Connection: close

Content-Type: text/html; charset=UTF-8



-------$_GET------------------

array(2) {

  ["n"]=>

  string(9) "perfgeeks"

  ["p"]=>

  string(4) "7788"

}



-------php://input-------------

T 192.168.0.8:36775 -> 192.168.0.6:80 [AP]

  GET /phpinput_server.php?n=perfgeeks&p=7788 HTTP/1.1..

  Host: 192.168.0.6..Connection: close....

1. Content-Type取值为application/x-www-form-urlencoded时，php会将http请求body相应数据会填入到数组$_POST，填入到$_POST数组中的数据是进行urldecode()解析的结果。（其实，除了该Content-Type，还有multipart/form-data表示数据是表单数据，稍后我们介绍）
2. php://input数据，只要Content-Type不为multipart/form-data(该条件限制稍后会介绍)。那么php://input数据与http entity body部分数据是一致的。该部分相一致的数据的长度由Content-Length指定。
3. 仅当Content-Type为application/x-www-form-urlencoded且提交方法是POST方法时，$_POST数据与php://input数据才是”一致”（打上引号，表示它们格式不一致，内容一致）的。其它情况，它们都不一致。
4. php://input读取不到$_GET数据。是因为$_GET数据作为query_path写在http请求头部(header)的PATH字段，而不是写在http请求的body部分。

<form enctype="multipart/form-data" action="phpinput_server.php" method="POST" >

    <input type="text" name="n"  />

    <input type="file" name="f" />

    <input type="submit" value="upload now" />

</form>

-------$_POST------------------

array(1) { ["n"]=> string(9) "perfgeeks" }

-------php://input-------------

########

T 192.168.0.8:3981 -> 192.168.0.6:80 [AP]

  POST /phpinput_server.php HTTP/1.1..Host: 192.168.0.6..Connection: kee

  p-alive..User-Agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US) A

  ppleWebKit/533.2 (KHTML, like Gecko) Chrome/5.0.342.3 Safari/533.2..Re

  ferer: http://192.168.0.6/phpinput_se ... ngth: 306..Ca

  che-Control: max-age=0..Origin: http://192.168.0.6..Content-Type: mult

  ipart/form-data; boundary=----WebKitFormBoundarybLQwkp4opIEZn1fA..Acce

  pt: application/xml,application/xhtml+xml,text/html;q=0.9,text/plain;q

  =0.8,image/png,*/*;q=0.5..Accept-Encoding: gzip,deflate,sdch..Accept-L

  anguage: zh-CN,zh;q=0.8..Accept-Charset: GBK,utf-8;q=0.7,*;q=0.3..Cook

  ie: SESS3b0e658f87cf58240de13ab43a399df6=lju6o5bg8u04lv1ojugm2ccic6...

  .

##

T 192.168.0.8:3981 -> 192.168.0.6:80 [AP]

  ------WebKitFormBoundarybLQwkp4opIEZn1fA..Content-Disposition: form-da

  ta; name="n"....perfgeeks..------WebKitFormBoundarybLQwkp4opIEZn1fA..C

  ontent-Disposition: form-data; name="f"; filename="test.txt"..Content-

  Type: text/plain....i am file..multipart/form-data..------WebKitFormBo

  undarybLQwkp4opIEZn1fA--..

##

$raw_post_data = file_get_contents('php://input', 'r');

$rtn = ($raw_post_data == $HTTP_RAW_POST_DATA) ? 1 : 0;

echo $rtn;

@php phpinput_post.php

@php phpinput_get.php

@php phpinput_xmlrpc.php

1. php://input 可以读取http entity body中指定长度的值，由Content-Length指定长度,不管是POST方式或者GET方法提交过来的数据。但是，一般GET方法提交数据时，http request entity body部分都为空。
2. php://input 与$HTTP_RAW_POST_DATA读取的数据是一样的，都只读取Content-Type不为multipart/form-data的数据。

1. Coentent-Type仅在取值为application/x-www-data-urlencoded和multipart/form-data两种情况下，PHP才会将http请求数据包中相应的数据填入全局变量$_POST
2. PHP不能识别的Content-Type类型的时候，会将http请求包中相应的数据填入变量$HTTP_RAW_POST_DATA
3. 只有Coentent-Type不为multipart/form-data的时候，PHP不会将http请求数据包中的相应数据填入php://input，否则其它情况都会。填入的长度，由Coentent-Length指定。
4. 只有Content-Type为application/x-www-data-urlencoded时，php://input数据才跟$_POST数据相一致。
5. php://input数据总是跟$HTTP_RAW_POST_DATA相同，但是php://input比$HTTP_RAW_POST_DATA更凑效，且不需要特殊设置php.ini
6. PHP会将PATH字段的query_path部分，填入全局变量$_GET。通常情况下，GET方法提交的http请求，body为空。