摘要：
206. Reverse Linked List Given the head of a singly linked list, reverse the list, and return the reversed list. Constraints: The number of nodes in t 阅读全文
posted @ 2023-01-30 13:45
AaronTanooo
阅读(31)
评论(0)
推荐(0)
摘要：
33. Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your func 阅读全文
posted @ 2023-01-29 18:40
AaronTanooo
阅读(40)
评论(0)
推荐(0)
摘要：
153. Find Minimum in Rotated Sorted Array Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the ar 阅读全文
posted @ 2023-01-29 17:46
AaronTanooo
阅读(27)
评论(0)
推荐(0)
摘要：
20. Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An inpu 阅读全文
posted @ 2023-01-29 17:02
AaronTanooo
阅读(19)
评论(0)
推荐(0)
摘要：
76. Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every chara 阅读全文
posted @ 2023-01-29 14:38
AaronTanooo
阅读(24)
评论(0)
推荐(0)
摘要：
424. Longest Repeating Character Replacement You are given a string s and an integer k. You can choose any character of the string and change it to an 阅读全文
posted @ 2023-01-12 15:33
AaronTanooo
阅读(24)
评论(0)
推荐(0)
摘要：
3. Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without repeating characters. Constraints 阅读全文
posted @ 2023-01-12 01:09
AaronTanooo
阅读(21)
评论(0)
推荐(0)
摘要：
121. Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize 阅读全文
posted @ 2023-01-11 17:03
AaronTanooo
阅读(26)
评论(0)
推荐(0)
摘要：
11. Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the i 阅读全文
posted @ 2023-01-10 19:25
AaronTanooo
阅读(24)
评论(0)
推荐(0)
摘要：
3Sum 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] + nu 阅读全文
posted @ 2023-01-10 19:01
AaronTanooo
阅读(15)
评论(0)
推荐(0)
浙公网安备 33010602011771号