LeetCode-Go
LeetCode-Go copied to clipboard
✅ Solutions to LeetCode by Go, 100% test coverage, runtime beats 100% / LeetCode 题解
nums1Mid = low + (high-low)>>1 // 分界限右侧是 mid,分界线左侧是 mid - 1 改为 nums1Mid = (high-low)>>1
Base Case Check: In your search Word function, you should check if index is equal to Len(word) - 1, but also need to ensure that the character at index matches...
You code does not skip the duplicated combination. You need to add skip duplicated combination . See below. if nums[i] > target { break } // the following to skip...
https://books.halfrost.com/leetcode/ChapterTwo/Math/