摘要：
Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. Example 1: Input: nums = [1,2, 阅读全文
posted @ 2022-11-07 09:59
MarkLeeBYR
阅读(31)
评论(0)
推荐(0)
摘要：
You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0]. Each element nums[i] represents the maximum len 阅读全文
posted @ 2022-11-06 22:46
MarkLeeBYR
阅读(28)
评论(0)
推荐(0)
摘要：
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum ju 阅读全文
posted @ 2022-11-06 21:29
MarkLeeBYR
阅读(31)
评论(0)
推荐(0)
摘要：
Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining. 阅读全文
posted @ 2022-11-06 20:19
MarkLeeBYR
阅读(24)
评论(0)
推荐(0)
摘要：
Given an unsorted integer array, find the smallest missing positive integer. Example 1: Input: [1,2,0]Output: 3Example 2: Input: [3,4,-1,1]Output: 2Ex 阅读全文
posted @ 2022-11-06 18:11
MarkLeeBYR
阅读(23)
评论(0)
推荐(0)
摘要：
Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums 阅读全文
posted @ 2022-11-06 16:11
MarkLeeBYR
阅读(28)
评论(0)
推荐(0)
摘要：
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文
posted @ 2022-11-06 15:47
MarkLeeBYR
阅读(22)
评论(0)
推荐(0)
摘要：
剑指offer：数字在排序数组中出现的次数 https://www.cnblogs.com/MarkLeeBYR/p/9774275.html 阅读全文
posted @ 2022-11-06 15:45
MarkLeeBYR
阅读(12)
评论(0)
推荐(0)
摘要：
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You a 阅读全文
posted @ 2022-11-06 14:17
MarkLeeBYR
阅读(23)
评论(0)
推荐(0)
摘要：
Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. Example 1: Inpu 阅读全文
posted @ 2022-11-05 23:19
MarkLeeBYR
阅读(22)
评论(0)
推荐(0)
浙公网安备 33010602011771号