Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to
target.- 5月 07 週日 202322:47
[LeetCode-C] 1. Two Sum
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to
- 4月 15 週六 202300:33
[LeetCode-C] 4. Median of Two Sorted Arrays
4. Median of Two Sorted Arrays
Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
- 4月 10 週一 202315:35
[LeetCode-C] 215. Kth Largest Element in an Array
215. Kth Largest Element in an Array
Given an integer array nums and an integer k, return the kth largest element in the array.
- 3月 30 週四 202314:06
[LeetCode-C] 75. Sort Colors
- 3月 30 週四 202300:03
[LeetCode-C] 179. Largest Number
179. Largest Number
Given a list of non-negative integers nums, arrange them such that they form the largest number and return it.
- 3月 29 週三 202300:56
[LeetCode-C] 27. Remove Element
27. Remove Element
Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.
Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number of elements in nums which are not equal to val.
- 3月 28 週二 202315:25
[LeetCode-C] 56. Merge Intervals
56. Merge Intervals
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.
- 3月 24 週五 202312:38
[LeetCode-C] 735. Asteroid Collision
735. Asteroid Collision
We are given an array asteroids of integers representing asteroids in a row.
- 3月 23 週四 202311:56
[LeetCode-C] 1249. Minimum Remove to Make Valid Parentheses
1249. Minimum Remove to Make Valid Parentheses
Given a string s of '(' , ')' and lowercase English characters.
Given a string s of '(' , ')' and lowercase English characters.
- 3月 22 週三 202323:33
[LeetCode-C] 1209. Remove All Adjacent Duplicates in String II
1209. Remove All Adjacent Duplicates in String II
You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and equal letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together.
烘焙 (2)