search

halfrost / LeetCode-Go

✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% / LeetCode 题解
https://books.halfrost.com/leetcode
MIT License
32.76k stars 5.68k forks source link

0004 bug #262

Open sohubill opened 1 year ago

sohubill commented 1 year ago

nums1Mid = low + (high-low)>>1 // 分界限右侧是 mid，分界线左侧是 mid - 1 改为 nums1Mid = (high-low)>>1