14559966275

Committed 20 Apr 2025 01:30PM CUT coverage: 96.345% (-0.04%) from 96.385%

Build # 14559966275

Build Type

push

github

Committed by

fxss5201

Commit Message

feat: 增加 14. 第一个元素、18. 获取元组长度、43. 实现 Exclude

Run Details

1014 of 1091 branches covered (92.94%)

Branch coverage included in aggregate %.

0 of 2 new or added lines in 1 file covered. (0.0%)

3652 of 3752 relevant lines covered (97.33%)

6.17 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

81.58

/src/leetcode/searchInRotatedSortedArrayIi/typescript.ts

// 81. 搜索旋转排序数组 II：https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/
// 输入：nums = [2,5,6,0,0,1,2], target = 0
// 输出：true

export function searchInRotatedSortedArrayIi (nums: number[], target: number): boolean {
  const n = nums.length
  if (n === 0) return false
  if (n === 1) return nums[0] === target
  let l = 0
  let r = n - 1
  while (l <= r) {
    const mid = Math.floor((l + r) / 2)
    if (nums[mid] === target) return true
    if (nums[l] === nums[mid] && nums[mid] === nums[r]) {
      l++
      r--
    } else if (nums[l] <= nums[mid]) {
      if (nums[l] <= target && target < nums[mid]) {
        r = mid - 1
      } else {
        l = mid + 1
      }
    } else {
      if (nums[mid] < target && target <= nums[n - 1]) {
        l = mid + 1
      } else {
        r = mid - 1
      }
    }
  }
  return false
}

1	// 81. 搜索旋转排序数组 II：https://leetcode.cn/problems/search-in-rotated-sorted-array-ii/
2	// 输入：nums = [2,5,6,0,0,1,2], target = 0
3	// 输出：true
4
5	export function searchInRotatedSortedArrayIi (nums: number[], target: number): boolean {	1✔
6	const n = nums.length	2✔
7	if (n === 0) return false	2!
8	if (n === 1) return nums[0] === target	2!
9	let l = 0	2✔
10	let r = n - 1	2✔
11	while (l <= r) {	2✔
12	const mid = Math.floor((l + r) / 2)	4✔
13	if (nums[mid] === target) return true	4✔
14	if (nums[l] === nums[mid] && nums[mid] === nums[r]) {	4✔
15	l++	1✔
16	r--	1✔
17	} else if (nums[l] <= nums[mid]) {	4✔
18	if (nums[l] <= target && target < nums[mid]) {	1✔
19	r = mid - 1	1✔
20	} else {	1!
21	l = mid + 1	×
22	}	×
23	} else {	1✔
24	if (nums[mid] < target && target <= nums[n - 1]) {	1!
25	l = mid + 1	×
26	} else {	1✔
27	r = mid - 1	1✔
28	}	1✔
29	}	1✔
30	}	4✔
31	return false	1✔
32	}	1✔

fxss5201 / fxss-leetcode / 14559966275

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous