- 博客(14)
- 收藏
- 关注
RSS订阅原创 Node.js+MongoDB+Express网站开发（一）：使用Ping++SDK接入支付功能
前言： 最近一直在用node开发网页，也实现了一些小功能，一直想写下来。之前的以后再写，先把刚刚实现的功能写下来，也算是一种经验总结吧！ -------------------------------------------------------------------------------------------------------------------------
2015-11-14 01:32:48
2117
原创 解决mysql5.6无法显示和插入中文(mac/linux)
系统：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%'; 改成像我这样的应该就可以显示和插入中文了。 在网上搜了一下有很多大同小异的解决办法。这里我把适用于我的
2015-10-17 13:26:59
3183
原创 1011. Find the external path length
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*
2015-01-13 21:02:04
582
原创 1010. bracket matching
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.
2015-01-12 22:08:33
587
原创 1007. Find the middle element in a Linked List
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(
2015-01-11 21:51:40
593
原创 1006. Join two lists
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
2015-01-11 21:43:55
336
原创 1005. 业绩排名
Description 年末公司将职员按照业绩从大到小排序后分配奖金。假定输入是职员姓名以及业绩, 业绩是正整数。 请你按照职员业绩从高到低将职员排序，业绩相同时按照输入先后次序排序。 输出是排序后的名次和职员姓名列表, 业绩相同时，名次相同。 例如，输入： (wang ming, 320), (gao min, 330), (zhang li, 280), (luo yan, 320
2015-01-11 21:35:30
595
原创 1004. Hashing
Description Implement the following Hash class using separate chaining. template class HashTable { public: HashTable(int (* h)(HashedObj x), int size = 101 ) : currentSize( 0
2015-01-11 20:49:40
542
原创 1003. Width of Binary Trees
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
2015-01-11 20:41:30
649
原创 1002. Is It Acyclic
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
2015-01-11 20:29:43
361
原创 1001. Bacon Number
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.
2015-01-10 21:39:16
743
原创 1000. Minimum Weight
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
2015-01-10 21:28:09
468
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人