https://blog.youkuaiyun.com/lfeng_codingzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/lfeng_coding/article/details/78117775https://blog.youkuaiyun.com/lfeng_coding/article/details/78117775lfeng_codingWed, 27 Sep 2017 21:54:14 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/50877923https://blog.youkuaiyun.com/lfeng_coding/article/details/50877923lfeng_codingSun, 13 Mar 2016 15:48:03 +0800输入cmd ==》输入enter]]>https://blog.youkuaiyun.com/lfeng_coding/article/details/50866348https://blog.youkuaiyun.com/lfeng_coding/article/details/50866348lfeng_codingSat, 12 Mar 2016 17:58:36 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/48010255https://blog.youkuaiyun.com/lfeng_coding/article/details/48010255lfeng_codingWed, 26 Aug 2015 21:13:40 +0800一书课后习题14.42，问题如下： 使用标准库函数对象及适配器定义一条表达式，令其：统计大于1024的值有多少个。 解题利用标准库函数对象类greater 答案为：count_if(vec.begin(),vec.end(),bind2nd(greater(),1024));这样就牵扯出了bind1st 和 bind2nd 这两个捆绑函数。 这两个适配器函数和标准库函数对象类都是定]]>https://blog.youkuaiyun.com/lfeng_coding/article/details/47975521https://blog.youkuaiyun.com/lfeng_coding/article/details/47975521lfeng_codingTue, 25 Aug 2015 13:11:31 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47973221https://blog.youkuaiyun.com/lfeng_coding/article/details/47973221lfeng_codingTue, 25 Aug 2015 10:20:44 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47960253https://blog.youkuaiyun.com/lfeng_coding/article/details/47960253lfeng_codingMon, 24 Aug 2015 22:16:49 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47782141https://blog.youkuaiyun.com/lfeng_coding/article/details/47782141lfeng_codingWed, 19 Aug 2015 16:05:43 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47779803https://blog.youkuaiyun.com/lfeng_coding/article/details/47779803lfeng_codingWed, 19 Aug 2015 14:06:18 +0800=0)个结点的有限集。 对于任意一棵非空树：（1）有且仅有一个特定的结点称为根结点；（2）当n>1时，其余结点可分为m（m>0）个互不相交的有限集T1，T2，T3···，Tm，其中每一个集合本身又是一棵树，并且称为根的子树。 结点：树的结点包含一个数据元素及若干指向其子树的分支。 度（degree）：结点拥有的子树数称为结点的度。 叶子（leaf)：度为]]>https://blog.youkuaiyun.com/lfeng_coding/article/details/47710475https://blog.youkuaiyun.com/lfeng_coding/article/details/47710475lfeng_codingMon, 17 Aug 2015 00:00:36 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47614765https://blog.youkuaiyun.com/lfeng_coding/article/details/47614765lfeng_codingThu, 13 Aug 2015 16:36:07 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47613905https://blog.youkuaiyun.com/lfeng_coding/article/details/47613905lfeng_codingThu, 13 Aug 2015 15:53:08 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47393919https://blog.youkuaiyun.com/lfeng_coding/article/details/47393919lfeng_codingMon, 10 Aug 2015 09:37:41 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47356535https://blog.youkuaiyun.com/lfeng_coding/article/details/47356535lfeng_codingSat, 08 Aug 2015 11:22:08 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47356193https://blog.youkuaiyun.com/lfeng_coding/article/details/47356193lfeng_codingSat, 08 Aug 2015 10:44:47 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47355671https://blog.youkuaiyun.com/lfeng_coding/article/details/47355671lfeng_codingSat, 08 Aug 2015 10:07:05 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47300563https://blog.youkuaiyun.com/lfeng_coding/article/details/47300563lfeng_codingWed, 05 Aug 2015 17:58:42 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47092481https://blog.youkuaiyun.com/lfeng_coding/article/details/47092481lfeng_codingMon, 27 Jul 2015 22:14:37 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47091211https://blog.youkuaiyun.com/lfeng_coding/article/details/47091211lfeng_codingMon, 27 Jul 2015 21:21:58 +0800https://blog.youkuaiyun.com/lfeng_coding/article/details/47000663https://blog.youkuaiyun.com/lfeng_coding/article/details/47000663lfeng_codingWed, 22 Jul 2015 11:19:34 +0800