<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[sss_coder的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/sss_coder</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; sss_coder]]></copyright><item><title><![CDATA[Node.js+MongoDB+Express网站开发（一）：使用Ping++SDK接入支付功能]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/49827421</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/49827421</guid><author>sss_coder</author><pubDate>Sat, 14 Nov 2015 01:32:48 +0800</pubDate><description><![CDATA[前言：
        最近一直在用node开发网页，也实现了一些小功能，一直想写下来。之前的以后再写，先把刚刚实现的功能写下来，也算是一种经验总结吧！
-------------------------------------------------------------------------------------------------------------------------]]></description><category></category></item><item><title><![CDATA[解决mysql5.6无法显示和插入中文(mac/linux)]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/49203185</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/49203185</guid><author>sss_coder</author><pubDate>Sat, 17 Oct 2015 13:26:59 +0800</pubDate><description><![CDATA[系统：Mac OS X 10.11
mysql：mysql-5.6.26-osx10.8-x86_64
GUI：Mysql Workench 6.3


原因在于mysql的编码方式。显示mysql编码方式：show variables like 'character%';


改成像我这样的应该就可以显示和插入中文了。
在网上搜了一下有很多大同小异的解决办法。这里我把适用于我的]]></description><category></category></item><item><title><![CDATA[解决Bochs调试时软盘无法加载的问题]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/45741859</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/45741859</guid><author>sss_coder</author><pubDate>Fri, 15 May 2015 10:56:06 +0800</pubDate><description><![CDATA[看看你的软盘是不是大于1440kb，超过了貌似就不能加载，可以删去软盘中多余的0使其小于1440kb.]]></description><category></category></item><item><title><![CDATA[mac下使用inode客户端上网无法开启互联网共享的解决办法]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/45426107</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/45426107</guid><author>sss_coder</author><pubDate>Sat, 02 May 2015 00:20:55 +0800</pubDate><description><![CDATA[请查看网络设置，如果ipv6开启可能会有问题；选择“仅本地连接”即可。]]></description><category></category></item><item><title><![CDATA[1011. Find the external path length]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42683557</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42683557</guid><author>sss_coder</author><pubDate>Tue, 13 Jan 2015 21:02:04 +0800</pubDate><description><![CDATA[Description

Given the linked representation of binary trees

typedef int T;
struct BinaryNode{
T data; //store data 
BinaryNode *left, *right;
BinaryNode(T d, BinaryNode *l=NULL, BinaryNode* ]]></description><category></category></item><item><title><![CDATA[1010. bracket matching]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42651703</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42651703</guid><author>sss_coder</author><pubDate>Mon, 12 Jan 2015 22:08:33 +0800</pubDate><description><![CDATA[Description

Implement the following function that decides if a list of brackets match.
bool brackets(string s);
/*
The input s is a list of brackets, including {,},(,),[,], and possibly blanks.]]></description><category></category></item><item><title><![CDATA[1007. Find the middle element in a Linked List]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42617621</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42617621</guid><author>sss_coder</author><pubDate>Sun, 11 Jan 2015 21:51:40 +0800</pubDate><description><![CDATA[Description

Assuming the following definition:
template struct Node {
   Node_entry entry;
   Node *next;
   Node();
   Node(Node_entry item, Node *add_on = NULL);
};

template  Node::Node(]]></description><category></category></item><item><title><![CDATA[1006. Join two lists]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42617401</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42617401</guid><author>sss_coder</author><pubDate>Sun, 11 Jan 2015 21:43:55 +0800</pubDate><description><![CDATA[Description


list join(const  list &a, const list &b)
//returns a list of distinct integers both in a and b. For example, a = (3,4,3,5); b = (2,3,2,12,4,4), then c = (3,4). or c = (4,3).  The ord]]></description><category></category></item><item><title><![CDATA[1005. 业绩排名]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42617141</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42617141</guid><author>sss_coder</author><pubDate>Sun, 11 Jan 2015 21:35:30 +0800</pubDate><description><![CDATA[Description

年末公司将职员按照业绩从大到小排序后分配奖金。假定输入是职员姓名以及业绩, 业绩是正整数。
请你按照职员业绩从高到低将职员排序，业绩相同时按照输入先后次序排序。
输出是排序后的名次和职员姓名列表, 业绩相同时，名次相同。
例如，输入： (wang ming, 320), (gao min, 330), (zhang li, 280), (luo yan, 320]]></description><category></category></item><item><title><![CDATA[1004. Hashing]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42615269</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42615269</guid><author>sss_coder</author><pubDate>Sun, 11 Jan 2015 20:49:40 +0800</pubDate><description><![CDATA[Description


Implement the following Hash class using separate chaining.
template 
class HashTable
{
  public:
     HashTable(int (* h)(HashedObj x), int size = 101 )
      : currentSize( 0 ]]></description><category></category></item><item><title><![CDATA[1003. Width of Binary Trees]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42615141</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42615141</guid><author>sss_coder</author><pubDate>Sun, 11 Jan 2015 20:41:30 +0800</pubDate><description><![CDATA[Description

The maximum number of nodes in all levels in a binary tree is called the width of the tree. For example, the binary tree on the right in the following figure has width 4 because the max]]></description><category></category></item><item><title><![CDATA[1002. Is It Acyclic]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42614965</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42614965</guid><author>sss_coder</author><pubDate>Sun, 11 Jan 2015 20:29:43 +0800</pubDate><description><![CDATA[Description

Given a directed graph, decide if it is acyclic (there is no directed cycle).


Input

There are multiple test cases. The first line contains an integer T, indicating the number of]]></description><category></category></item><item><title><![CDATA[1001. Bacon Number]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42588507</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42588507</guid><author>sss_coder</author><pubDate>Sat, 10 Jan 2015 21:39:16 +0800</pubDate><description><![CDATA[Description

The Bacon number of an actor is the number of degrees of separation he or she has from Bacon. For example, Tom Hanks has a Bacon number 1, because he was in Apollo 13 with Kevin Bacon. ]]></description><category></category></item><item><title><![CDATA[1000. Minimum Weight]]></title><link>https://blog.youkuaiyun.com/sss_coder/article/details/42588193</link><guid>https://blog.youkuaiyun.com/sss_coder/article/details/42588193</guid><author>sss_coder</author><pubDate>Sat, 10 Jan 2015 21:28:09 +0800</pubDate><description><![CDATA[Description

Given a list of weights w1, w2, ..., wn, we can construct a binary tree with n leaves, where each leaf is marked with one weight. The is called a weighted binary tree. The weight
 of t]]></description><category></category></item></channel></rss>