全站内容
easy
46. Permutations
#Problem Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. A permutation is a rearrangement of all the elements of an array. https://leetcode.cn/problems/permutations/ …
1790. Check if One String Swap Can Make Strings Equal
#Problem You are given two strings s1 and s2 of equal length. A string swap is an operation where you choose two indices in a string (not necessarily different) and swap the characters at these indices. Return true if it is possible to make …
90. Subsets II
#Problem Given an integer array nums that may contain duplicates, return all possible subsets (the power set). A subset of an array is a selection of elements (possibly none) of the array. The solution set must not contain duplicate …
78. Subsets
#Problem Given an integer array nums of unique elements, return all possible subsets (the power set). A subset of an array is a selection of elements (possibly none) of the array. The solution set must not contain duplicate subsets. Return …
1800. Maximum Ascending Subarray Sum
#Problem Given an array of positive integers nums, return the maximum possible sum of an ascending subarray in nums. A subarray is defined as a contiguous sequence of numbers in an array. A subarray [numsl, numsl+1, ..., numsr-1, numsr] is …
922. Sort Array By Parity II
#Problem Given an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even, i is even. Return any answer array that …
905. Sort Array By Parity
#Problem Given an integer array nums, move all the even integers at the beginning of the array followed by all the odd integers. Return any array that satisfies this condition. https://leetcode.cn/problems/sort-array-by-parity/ Example 1: …
3105. Longest Strictly Increasing or Strictly Decreasing Subarray
#Problem You are given an array of integers nums. Return the length of the longest subarray of nums which is either strictly increasing or strictly decreasing. A subarray is a contiguous non-empty sequence of elements within an array. An …
680. Valid Palindrome II
#Problem Given a string s, return true if the s can be palindrome after deleting at most one character from it. https://leetcode.cn/problems/valid-palindrome-ii/ Example 1: Input: s = "aba" Output: true Example 2: Input: s = "abca" Output: …
1752. Check if Array Is Sorted and Rotated
#Problem Given an array nums, return true if the array was originally sorted in non-decreasing order, then rotated some number of positions (including zero). Otherwise, return false. There may be duplicates in the original array. Note: An …