https://blog.youkuaiyun.com/Tri_Color_Flagzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/70667125https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/70667125Tri_Color_FlagTue, 25 Apr 2017 00:02:54 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53463078https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53463078Tri_Color_FlagMon, 05 Dec 2016 11:32:44 +080010->4->5, tail connects to node index 1，返回10 挑战不使用额外的空间 题解首先通过快慢指针得到该链表是否带环，如果有环则将快慢指针进行重置，分别指向头节点和之前相遇的节点，再进行单步前进，两指针相遇的节点就是环的入口节点。]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53457255https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53457255Tri_Color_FlagSun, 04 Dec 2016 22:54:05 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53457052https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53457052Tri_Color_FlagSun, 04 Dec 2016 22:27:35 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53456914https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53456914Tri_Color_FlagSun, 04 Dec 2016 22:09:08 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53389937https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53389937Tri_Color_FlagTue, 29 Nov 2016 12:21:22 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53375300https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53375300Tri_Color_FlagMon, 28 Nov 2016 11:36:23 +0800 1 ‘B’ -> 2 … ‘Z’ -> 26 现在给你一个加密过后的消息，问有几种解码的方式 样例给你的消息为12，有两种方式解码 AB(12) 或者 L(12). 所以返回 2 题解 本题和爬梯子问题非常类似，除了在0的处理上需要注意，比如0不可以单独存在，也不可以作为十位数进行组合。构件dp数组，对字符串进行遍历，如果]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53267924https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53267924Tri_Color_FlagMon, 21 Nov 2016 23:04:07 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53257379https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53257379Tri_Color_FlagMon, 21 Nov 2016 11:31:26 +0800 a[j] 且 i < j， a[i] 和 a[j] 构成一个逆序对。 样例序列 [2, 4, 1, 3, 5] 中，有 3 个逆序对 (2, 1), (4, 1), (4, 3)，则返回 3 。 题解本题在归并排序的基础上进行修改就可以了，]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229648https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229648Tri_Color_FlagSat, 19 Nov 2016 13:58:00 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229576https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229576Tri_Color_FlagSat, 19 Nov 2016 13:45:28 +0800 queue = null; private static char[][] boar]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229372https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229372Tri_Color_FlagSat, 19 Nov 2016 13:25:18 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229132https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53229132Tri_Color_FlagSat, 19 Nov 2016 12:29:00 +08002->3->4->null ，以及 v1 = 2 ， v2 = 4 返回结果 1->4->3->2->null。 题解基本的链表题，需注意两个节点相邻的问题]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53228529https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53228529Tri_Color_FlagSat, 19 Nov 2016 12:13:31 +0800 nums[2] < nums[3]….注意事项 你可以认为每个输入都有合法解 样例给出 nums = [1, 5, 1, 1, 6, 4],一种方案为 [1, 4, 1, 5, 1, 6]. 给出 nums = [1, 3, 2, 2, 3, 1],一种方案为 [2, 3, 1, 3, 1,]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53227516https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53227516Tri_Color_FlagSat, 19 Nov 2016 09:36:16 +0800= nums[2] <= nums[3]….注意事项 请就地排序数组，也就是不需要额外数组 样例给出数组为 nums = [3, 5, 2, 1, 6, 4] 一种输出方案为 [1, 6, 2, 5, 3, 4] 题解 从i=1开始遍历数组，如果是奇数位则应该是nums[i]>=n]]>https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53224946https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53224946Tri_Color_FlagSat, 19 Nov 2016 00:00:07 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53224576https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53224576Tri_Color_FlagFri, 18 Nov 2016 23:18:55 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53213941https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53213941Tri_Color_FlagFri, 18 Nov 2016 11:00:56 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53208376https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53208376Tri_Color_FlagFri, 18 Nov 2016 10:36:40 +0800https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53208344https://blog.youkuaiyun.com/Tri_Color_Flag/article/details/53208344Tri_Color_FlagThu, 17 Nov 2016 23:26:10 +0800