- 博客(4)
- 收藏
- 关注
RSS订阅原创 leetcode二分查找学习
⼆分查找场景：寻找⼀个数、寻找左侧边界、寻 找右侧边界。int binarySearch(int[] nums, int target) { int left = 0, right = ...; while(...) { int mid = (right + left) / 2; if (nums[mid] == target) { ... } else if (nums[mid] < target) {
2022-05-30 15:35:48
69
原创 leetcode日常学习
1，滑动窗口int minSubArrayLen(int target, int* nums, int numsSize){ if (numsSize == 0) { return 0; } int sum = 0; int ans = INT_MAX; int left = 0; int right = 0; while (right < numsSize) { //窗口右边界 sum += nums[ri............
2022-05-29 00:07:31
164
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人