0%

## swoole-websocket-test

Posted on 2016-07-13 Edited on 2020-01-12 In php Views: Disqus:

### 玩一下swoole的websocket

WebSocket是HTML5开始提供的一种在单个TCP连接上进行全双工通讯的协议。WebSocket通信协议于2011年被IETF定为标准RFC 6455，WebSocketAPI被W3C定为标准。
,在web私信，im等应用较多。背景和优缺点可以参看wiki。

### 环境准备

因为swoole官方还不支持windows，所以需要装下linux,之前都是用ubuntu，
这次就试一下centos7，还是满好看的，虽然虚拟机会默认最小安装，需要在安装
时自己选择带gnome的，当然最小安装也是可以的，只是最后需要改下防火墙。
然后是装下PHP，Nginx什么的，我是用Oneinstack，可以按需安装
给做这个的大大点个赞。

Read more »

## invert-binary-tree

Posted on 2015-06-22 Edited on 2020-01-12 In leetcode Views: Disqus:

Invert a binary tree

         4
       /   \
      2     7
     / \   / \
    1   3 6   9

to

         4
       /   \
      7     2
     / \   / \
    9   6 3   1

Trivia:
This problem was inspired by this original tweet by Max Howell:

> Google: 90% of our engineers use the software you wrote (Homebrew),
> but you can’t invert a binary tree on a whiteboard so fuck off.

    1
    2
    3
    4
    5
    6
    7
    8
    9
    10
    11
    12
    13
    14
    15
    16
    17
    18
    19
    20

    /**
     * Definition for a binary tree node.
     * struct TreeNode {
     *     int val;
     *     TreeNode *left;
     *     TreeNode *right;
     *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
     * };
     */
    class Solution {
    public:
        TreeNode* invertTree(TreeNode* root) {
            if(root == NULL) return root;
            TreeNode* temp;
            temp = invertTree(root->left);
            root->left = invertTree(root->right);
            root->right = temp;
            return root;
        }
    };

## leetcode no.3

Posted on 2015-04-15 Edited on 2020-01-12 In leetcode Views: Disqus:

*Longest Substring Without Repeating Characters *

Read more »

## add-two-number

Posted on 2015-04-14 Edited on 2020-01-12 In leetcode Views: Disqus:

### problem

You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

Input:`(2 -> 4 -> 3) + (5 -> 6 -> 4)`
Output: `7 -> 0 -> 8`

分析（不用英文装逼了）
这个代码是抄来的，链接原作是这位大大。

Read more »

## Reverse Integer

Posted on 2015-03-13 Edited on 2020-01-12 In leetcode Views: Disqus:

### Reverse Integer

#### Reverse digits of an integer.

Example1: x = 123, return 321
Example2: x = -123, return -321

Read more »