https://blog.youkuaiyun.com/angelazyzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/angelazy/article/details/51029079https://blog.youkuaiyun.com/angelazy/article/details/51029079angelazyThu, 31 Mar 2016 18:23:53 +0800https://blog.youkuaiyun.com/angelazy/article/details/50465058https://blog.youkuaiyun.com/angelazy/article/details/50465058angelazyFri, 04 Mar 2016 21:41:48 +0800https://blog.youkuaiyun.com/angelazy/article/details/49836483https://blog.youkuaiyun.com/angelazy/article/details/49836483angelazySat, 14 Nov 2015 16:08:52 +0800https://blog.youkuaiyun.com/angelazy/article/details/48687617https://blog.youkuaiyun.com/angelazy/article/details/48687617angelazyWed, 23 Sep 2015 21:00:23 +0800https://blog.youkuaiyun.com/angelazy/article/details/48685931https://blog.youkuaiyun.com/angelazy/article/details/48685931angelazyWed, 23 Sep 2015 19:42:19 +0800https://blog.youkuaiyun.com/angelazy/article/details/48685885https://blog.youkuaiyun.com/angelazy/article/details/48685885angelazyWed, 23 Sep 2015 19:38:44 +0800https://blog.youkuaiyun.com/angelazy/article/details/48685415https://blog.youkuaiyun.com/angelazy/article/details/48685415angelazyWed, 23 Sep 2015 19:21:16 +0800https://blog.youkuaiyun.com/angelazy/article/details/48684295https://blog.youkuaiyun.com/angelazy/article/details/48684295angelazyWed, 23 Sep 2015 18:58:18 +0800https://blog.youkuaiyun.com/angelazy/article/details/48684199https://blog.youkuaiyun.com/angelazy/article/details/48684199angelazyWed, 23 Sep 2015 18:50:53 +0800https://blog.youkuaiyun.com/angelazy/article/details/48683927https://blog.youkuaiyun.com/angelazy/article/details/48683927angelazyWed, 23 Sep 2015 18:45:56 +0800https://blog.youkuaiyun.com/angelazy/article/details/48683907https://blog.youkuaiyun.com/angelazy/article/details/48683907angelazyWed, 23 Sep 2015 18:24:14 +0800https://blog.youkuaiyun.com/angelazy/article/details/48683755https://blog.youkuaiyun.com/angelazy/article/details/48683755angelazyWed, 23 Sep 2015 18:11:22 +0800 题目要求将二叉树的左右子树进行逆转。解题思路根据题目的要求可以进行一层一层的逆转，也就是交换结点的左右子树。将未处理的元素放入栈中，本题的关键在于对于元素的入栈顺序进行控制。/** * Definition for a binary tree node. * struct TreeNode { * int val; *]]>https://blog.youkuaiyun.com/angelazy/article/details/48681621https://blog.youkuaiyun.com/angelazy/article/details/48681621angelazyWed, 23 Sep 2015 16:11:22 +0800https://blog.youkuaiyun.com/angelazy/article/details/48680773https://blog.youkuaiyun.com/angelazy/article/details/48680773angelazyWed, 23 Sep 2015 15:20:54 +0800 “/home” path = “/a/./b/../../c/”, => “/c”本题要求对给定的Unix路径进行简化，关键点在于理解Unix路径的规则以及对一些边界条件要加以考虑。Unix路径规则：]]>https://blog.youkuaiyun.com/angelazy/article/details/48677825https://blog.youkuaiyun.com/angelazy/article/details/48677825angelazyWed, 23 Sep 2015 14:55:59 +0800https://blog.youkuaiyun.com/angelazy/article/details/48677547https://blog.youkuaiyun.com/angelazy/article/details/48677547angelazyWed, 23 Sep 2015 11:22:10 +0800https://blog.youkuaiyun.com/angelazy/article/details/48677191https://blog.youkuaiyun.com/angelazy/article/details/48677191angelazyWed, 23 Sep 2015 10:59:19 +0800https://blog.youkuaiyun.com/angelazy/article/details/48676983https://blog.youkuaiyun.com/angelazy/article/details/48676983angelazyWed, 23 Sep 2015 10:48:26 +0800https://blog.youkuaiyun.com/angelazy/article/details/48661833https://blog.youkuaiyun.com/angelazy/article/details/48661833angelazyTue, 22 Sep 2015 21:18:45 +0800https://blog.youkuaiyun.com/angelazy/article/details/48661725https://blog.youkuaiyun.com/angelazy/article/details/48661725angelazyTue, 22 Sep 2015 21:12:32 +0800