https://blog.youkuaiyun.com/m0_73523976zh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/m0_73523976/article/details/158574739https://blog.youkuaiyun.com/m0_73523976/article/details/158574739m0_73523976Mon, 02 Mar 2026 20:56:21 +0800 1，触发剪枝，break。]]>https://blog.youkuaiyun.com/m0_73523976/article/details/158392281https://blog.youkuaiyun.com/m0_73523976/article/details/158392281m0_73523976Fri, 27 Feb 2026 21:38:09 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/158347614https://blog.youkuaiyun.com/m0_73523976/article/details/158347614m0_73523976Tue, 24 Feb 2026 20:26:50 +0800 2，right = 1；4、第三次循环：left = 0，right = 1，mid = 0，nums[0] = 1，1 < 2，left = 1；i // 3：行号整除3，确定宫所在的行数，0 = 第0~2行，1 = 第3~5行，2 = 第6~8行；j // 3：列号整除3，确定宫所在的列数，0 = 第0~2列，1 = 第3~5列，2 = 第6~8列。1、初始：left = 0，right = 4；]]>https://blog.youkuaiyun.com/m0_73523976/article/details/158287128https://blog.youkuaiyun.com/m0_73523976/article/details/158287128m0_73523976Mon, 23 Feb 2026 21:32:03 +0800 target， 0 < 7，且左半部分有序，但0不在此部分内，所以left = 4;此时，left = 4，right = 6，mid = 5，nums[mid] = 1，nums[mid] > target，0 < 1，且 右半部分有序，但0也不在此部分内，所以right = 4；根据题目提示，时间复杂度为O(logn)，所以我想到的还是二分法。按升序排列，数组中的值。]]>https://blog.youkuaiyun.com/m0_73523976/article/details/158261577https://blog.youkuaiyun.com/m0_73523976/article/details/158261577m0_73523976Sat, 21 Feb 2026 21:04:30 +0800 1，不满足；当i = 2时，nums[0] = 2，nums[1] = 3，2 < 3，满足；]]>https://blog.youkuaiyun.com/m0_73523976/article/details/158153930https://blog.youkuaiyun.com/m0_73523976/article/details/158153930m0_73523976Fri, 20 Feb 2026 11:58:00 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/158152280https://blog.youkuaiyun.com/m0_73523976/article/details/158152280m0_73523976Tue, 17 Feb 2026 13:16:47 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157931275https://blog.youkuaiyun.com/m0_73523976/article/details/157931275m0_73523976Sat, 14 Feb 2026 15:34:56 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157843344https://blog.youkuaiyun.com/m0_73523976/article/details/157843344m0_73523976Sun, 08 Feb 2026 15:48:13 +0800 2 -> 1 -> 4 -> 3 -> 5。prev_group_end = 1，此时链表：0 -> 2 -> 1 -> 3 -> 4 -> 5。5、返回dummy.next = 2，最终链表为：2 -> 1 -> 4 -> 3 -> 5。]]>https://blog.youkuaiyun.com/m0_73523976/article/details/157804295https://blog.youkuaiyun.com/m0_73523976/article/details/157804295m0_73523976Fri, 06 Feb 2026 21:10:17 +0800 2 -> 3 ->None，最后一个节点3不交换，结果为2 -> 1 -> 3，符合要求。first = 1，second = 2，first.next = f(3)，即1.next = 4；虚拟头节点统一处理所有节点对的交换逻辑。初始状态：dummy(0) -> 1 -> 2 -> 3 -> 4，prev = dummy。状态：2 -> 1 -> 4 -> 3，prex.next = 4，prex = 3；状态：0 -> 2 -> 1 -> 3 -> 4，prex = 1；]]>https://blog.youkuaiyun.com/m0_73523976/article/details/157762302https://blog.youkuaiyun.com/m0_73523976/article/details/157762302m0_73523976Thu, 05 Feb 2026 14:51:50 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157686000https://blog.youkuaiyun.com/m0_73523976/article/details/157686000m0_73523976Wed, 04 Feb 2026 21:15:01 +08003->5,2->4->6) -> 1 < 2 -> 1.next = merge(3->5,2->4->6),返回1;2、第二层调用：merge(3->5,2->4->6) -> 3 > 2 ->2.next = merge(3->5,4->6)，返回2；3、第三层调用：merge(3->5,4->6) -> 4 > 3 ->3.next = merge(5,4->6)，返回3；7、list1为空，循环结束，current.next = list2，也就是剩下的数字6；]]>https://blog.youkuaiyun.com/m0_73523976/article/details/157619520https://blog.youkuaiyun.com/m0_73523976/article/details/157619520m0_73523976Mon, 02 Feb 2026 14:43:16 +0800 1 --> fast.next = 4None，继续；2、第二次循环：fast从3到4，slow从1 --> 2 --> fast.next = 5None，继续；3、第三次循环：fast从4到5，slow从2 --> 3 --> fast.next = None，循环结束。]]>https://blog.youkuaiyun.com/m0_73523976/article/details/157553316https://blog.youkuaiyun.com/m0_73523976/article/details/157553316m0_73523976Sat, 31 Jan 2026 16:24:00 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157516230https://blog.youkuaiyun.com/m0_73523976/article/details/157516230m0_73523976Fri, 30 Jan 2026 17:35:35 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157468695https://blog.youkuaiyun.com/m0_73523976/article/details/157468695m0_73523976Wed, 28 Jan 2026 20:00:09 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157438510https://blog.youkuaiyun.com/m0_73523976/article/details/157438510m0_73523976Tue, 27 Jan 2026 21:23:12 +0800 C（1000 > 100），total += 1000，total = 1000；i = 5时，roman_map[5] = I，I = 1，I < V（1 < 5），total -= 1，total = 1989；i = 0时，roman_map[0] = I，I = 1，V = 5，I < V，total -= 1，total = -1；我们可以统一遍历，当当前字符的值小于下一个字符的值时，就减去当前值；]]>https://blog.youkuaiyun.com/m0_73523976/article/details/157400356https://blog.youkuaiyun.com/m0_73523976/article/details/157400356m0_73523976Mon, 26 Jan 2026 20:21:58 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157359821https://blog.youkuaiyun.com/m0_73523976/article/details/157359821m0_73523976Mon, 26 Jan 2026 17:03:35 +0800https://blog.youkuaiyun.com/m0_73523976/article/details/157328259https://blog.youkuaiyun.com/m0_73523976/article/details/157328259m0_73523976Sat, 24 Jan 2026 21:02:08 +0800