<![CDATA[wefun的博客]]>https://blog.youkuaiyun.com/wefunzh-cnhttps://blog.youkuaiyun.com/<![CDATA[编程求解，输入两个整数n和m,从数列1,2,3，……n中随意取几个数，使其和等于m。要求将所有的可能组合列出来（背包问题求解）]]>https://blog.youkuaiyun.com/wefun/article/details/79403368https://blog.youkuaiyun.com/wefun/article/details/79403368wefunWed, 28 Feb 2018 17:40:04 +0800<![CDATA[输入一个表示整数的字符串，把该字符串转换成整数并输出。例如输入字符串"345"，则输出整数345]]>https://blog.youkuaiyun.com/wefun/article/details/79401624https://blog.youkuaiyun.com/wefun/article/details/79401624wefunWed, 28 Feb 2018 16:02:05 +0800<![CDATA[输入一颗二元树，从上往下按层打印树的每个结点，同一层中按照从左往右的顺序打印。]]>https://blog.youkuaiyun.com/wefun/article/details/79322733https://blog.youkuaiyun.com/wefun/article/details/79322733wefunTue, 13 Feb 2018 18:19:30 +0800<![CDATA[输入一颗二元查找树，将该树转换为它的镜像]]>https://blog.youkuaiyun.com/wefun/article/details/79322720https://blog.youkuaiyun.com/wefun/article/details/79322720wefunTue, 13 Feb 2018 18:16:06 +0800<![CDATA[求二叉树中节点的最大距离]]>https://blog.youkuaiyun.com/wefun/article/details/79322714https://blog.youkuaiyun.com/wefun/article/details/79322714wefunTue, 13 Feb 2018 18:13:59 +0800<![CDATA[判断整数序列是不是二元查找树的后序遍历结果]]>https://blog.youkuaiyun.com/wefun/article/details/79322699https://blog.youkuaiyun.com/wefun/article/details/79322699wefunTue, 13 Feb 2018 18:12:36 +0800<![CDATA[颠倒一个链表的顺序 C++]]>https://blog.youkuaiyun.com/wefun/article/details/78678811https://blog.youkuaiyun.com/wefun/article/details/78678811wefunThu, 30 Nov 2017 20:01:57 +0800<![CDATA[关于两个链表是否相交的思路总结]]>https://blog.youkuaiyun.com/wefun/article/details/78663065https://blog.youkuaiyun.com/wefun/article/details/78663065wefunWed, 29 Nov 2017 11:43:19 +0800