上一页 1 ··· 3 4 5 6 7 8 9 10 11 12 下一页
摘要: 题目 You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, 阅读全文
posted @ 2022-03-17 16:30 frankming 阅读(18) 评论(0) 推荐(0) 编辑
摘要: 题目 You are given two lists of closed intervals, firstList and secondList, where firstList[i] = [starti, endi] and secondList[j] = [startj, endj]. Each 阅读全文
posted @ 2022-03-17 00:26 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要: 题目 Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character. Note that af 阅读全文
posted @ 2022-03-15 23:59 frankming 阅读(27) 评论(0) 推荐(0) 编辑
摘要: 题目 Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums 阅读全文
posted @ 2022-03-15 15:15 frankming 阅读(33) 评论(0) 推荐(0) 编辑
摘要: 题目 Given the head of a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Return 阅读全文
posted @ 2022-03-15 14:40 frankming 阅读(23) 评论(0) 推荐(0) 编辑
摘要: 题目 A peak element is an element that is strictly greater than its neighbors. Given an integer array nums, find a peak element, and return its index. I 阅读全文
posted @ 2022-03-13 23:47 frankming 阅读(18) 评论(0) 推荐(0) 编辑
摘要: 题目 Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become 阅读全文
posted @ 2022-03-13 23:25 frankming 阅读(19) 评论(0) 推荐(0) 编辑
摘要: 题目 Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Integers 阅读全文
posted @ 2022-03-11 15:01 frankming 阅读(20) 评论(0) 推荐(0) 编辑
摘要: 题目 There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated a 阅读全文
posted @ 2022-03-11 14:31 frankming 阅读(18) 评论(0) 推荐(0) 编辑
摘要: 题目 Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not fou 阅读全文
posted @ 2022-03-11 14:16 frankming 阅读(23) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 9 10 11 12 下一页