feat: new stydy 📄

Author: m9rco

package/Other/MonkeyKing.php

@@ -0,0 +1,66 @@
+<?php
+
+/**
+ * MonkeyKing
+ *
+ * @author   Pu ShaoWei <[email protected]>
+ * @date     2017/8/23
+ * @license  Mozilla
+ * -------------------------------------------------------------
+ * 思路分析：单项循环数据链表 
+ * -------------------------------------------------------------
+ *有M个monkey ，转成一圈，第一个开始数数，数到第N个出圈，下一个再从1开始数，再数到第N个出圈，直到圈里只剩最后一个就是大王
+ */
+class MonkeyKing
+{
+    protected $next;
+    protected $name;
+
+    /**
+     * MonkeyKing constructor.
+     *
+     * @param $name
+     */
+    public function __construct($name)
+    {
+        $this->name = $name;
+    }
+
+    /**
+     * whoIsKing
+     *
+     * @static
+     * @param $count
+     * @param $num
+     * @return mixed
+     */
+    public static function whoIsKing($count, $num)
+    {
+        // 构造单向循环链表
+        $current = $first = new MonkeyKing(1);
+        for ($i = 2; $i <= $count; $i++){
+            $current->next = new MonkeyKing($i);
+            $current       = $current->next;
+        }
+        // 最后一个指向第一个
+        $current->next = $first;
+        // 指向第一个
+        $current = $first;
+        // 定义一个数字
+        $cn = 1;
+        while ($current !== $current->next){
+            $cn++;
+            if ($cn == $num) {
+                $current->next = $current->next->next;
+                $cn            = 1;
+            }
+            $current = $current->next;
+        }
+        // 返回猴子姓名
+        return $current->name;
+    }
+}
+
+// 共10个猴子每3个出圈
+var_dump(MonkeyKing::whoIsKing(10, 3));
+

package/Query/QulickQuery.php

@@ -0,0 +1,44 @@
+<?php
+
+/**
+ * QulickQuery
+ *
+ * @author   Pu ShaoWei <[email protected]>
+ * @date     2017/8/23
+ * @license  Mozilla
+ * -------------------------------------------------------------
+ * 思路分析：数组中间的值floor((low+top)/2) 
+ * -------------------------------------------------------------
+ * 重复第二步操作直至找出目标数字
+ */
+
+/**
+ * @param     $array
+ * @param     $k
+ * @param int $low
+ * @param int $high
+ * @return int
+ */
+function QulickQuery($array, $k, $low = 0, $high = 0)
+{
+    //判断是否为第一次调用
+    if (count($array) != 0 and $high == 0) {
+        $high = count($array);
+    }
+    //如果还存在剩余的数组元素
+    if ($low <= $high) {
+        //取$low和$high的中间值
+        $mid = intval(($low + $high) / 2);
+        //如果找到则返回
+        if ($array[ $mid ] == $k) {
+            return $mid;
+        }else if ($k < $array[ $mid ]) {//如果没有找到，则继续查找
+            return QulickQuery($array, $k, $low, $mid - 1);
+        } else {
+            return QulickQuery($array, $k, $mid + 1, $high);
+        }
+    }
+    return -1;
+}
+
+echo QulickQuery([4, 5, 7, 8, 9, 10, 8], 8);