数组·driven 模式

插入区间

Given a sorted array of non-overlapping intervals, insert a new interval and merge any overlapping intervals.

汇总区间

Summary Ranges involves converting a sorted array of unique integers into a minimal list of range strings.

最大连续 1 的个数

Find the maximum sequence of consecutive 1s in a binary array using an efficient array-driven scanning approach.

非递减数列

Check if an array can become non-decreasing by modifying at most one element using an array-driven solution strategy.

最长连续递增序列

Find the length of the longest continuous increasing subsequence in an unsorted integer array using an array-driven solu…

1 比特与 2 比特字符

Determine whether the last character in a binary array represents a one-bit character or a two-bit character.

到最近的人的最大距离

Determine the seat placement that maximizes distance to the nearest person using a linear array scan strategy efficientl…

单调数列

Determine if an integer array is entirely monotone increasing or decreasing using a clear array-driven approach.

分割数组

Partition the array into two subarrays such that the left contains the smallest possible elements and the right contains…

有效的山脉数组

The 'Valid Mountain Array' problem requires determining if an array meets the conditions of a valid mountain array using…

公交站间的距离

Compute the minimal distance between two bus stops on a circular route using an array-driven solution approach.

有序数组中出现次数超过25%的元素

Identify the integer occurring more than 25% in a sorted array using a precise array-driven search strategy for efficien…

将每个元素替换为右侧最大元素

Replace every element in an array with the greatest element on its right side, and replace the last element with -1.

解压缩编码列表

Decompress a run-length encoded list by expanding each pair into repeated values based on frequency.

二进制字符串前缀一致的次数

Count how many times a 1-indexed binary string becomes prefix-aligned as bits are flipped sequentially using an array-dr…

拥有最多糖果的孩子

Determine which kids, after receiving extra candies, will have the greatest number of candies in a group.

是否所有 1 都至少相隔 k 个元素

Check if all 1's in a binary array are at least k places away from each other.

在既定时间做作业的学生人数

Count the number of students doing homework at a given time using an array-driven solution approach.

重新排列数组

Shuffle the Array requires an efficient approach to rearrange elements using an array-driven solution strategy with two …

存在连续三个奇数的数组

Determine if an integer array contains three consecutive odd numbers using a direct array-driven solution strategy for f…

可以形成最大正方形的矩形数目

Determine how many rectangles can be trimmed to form the largest possible square using an array-driven solution strategy…

检查数组是否经排序和轮转得到

Determine if a given integer array is sorted in non-decreasing order and then rotated, handling duplicates correctly.

找到最近的有相同 X 或 Y 坐标的点

Find the nearest point with the same x or y coordinate using Manhattan distance. Return its index or -1 if none exists.

最大升序子数组和

Solve Maximum Ascending Subarray Sum by scanning once, extending rising runs, and resetting the running sum at each drop…

到目标元素的最小距离

Solve Minimum Distance to the Target Element by scanning the array and tracking the smallest distance from start.

删除一个元素使数组严格递增

Determine if removing a single element from an array can make it strictly increasing, using a careful index check approa…

数组美丽值求和

Calculate the sum of beauty for array elements using prefix and suffix tracking to optimize evaluation across indices ef…

增量元素之间的最大差值

Find the maximum difference between two increasing elements in an array using a linear scan to track the minimum value e…

值相等的最小索引

Find the smallest index where the index mod 10 equals the value at that index in the given array.

分组得分最高的所有下标

Find all indices in a binary array where division score is maximized.

统计数组中相等且可以被整除的数对

Given an array, count pairs of elements that are equal and their indices product is divisible by a given integer.

统计数组中峰和谷的数量

Count Hills and Valleys in an Array determines the number of hills and valleys in a given array by analyzing index neigh…

找到最接近 0 的数字

Identify the number in an integer array that is closest to zero, returning the larger one if tied.

处理用时最长的那个任务的员工

Identify which employee spent the longest time on a task using an array-driven approach, analyzing each log entry effici…

找出可整除性得分最大的整数

Determine the divisor with the highest count of divisible elements in an array using a clear array-driven strategy.

有相同颜色的相邻元素数目

Calculate the number of adjacent elements sharing the same color after sequentially updating an initially zeroed array u…

满足目标工作时长的员工数目

Determine how many employees reach the required work hours using a direct array-driven counting approach.

使数组成为递增数组的最少右移次数

Determine the minimum number of right shifts to sort a distinct integer array or return -1 if impossible using array ana…

有序三元组中的最大值 I

Find the maximum value of a triplet in an array where indices follow the order i < j < k.

有序三元组中的最大值 II

Solve Maximum Value of an Ordered Triplet II in linear time by tracking the best left difference and right multiplier.

元素和最小的山形三元组 I

Find the minimum sum of a mountain triplet in an array of integers, or return -1 if no valid triplet exists.

元素和最小的山形三元组 II

Find the minimum sum of a valid mountain triplet in an integer array, or return -1 if no valid triplet exists.

对角线最长的矩形的面积

Find the rectangle with the longest diagonal in a 2D array and return its area, prioritizing maximum area on ties.

超过阈值的最少操作数 I

Count how many numbers are below k, because each such value must be removed in Minimum Operations to Exceed Threshold Va…

最长的严格递增或递减子数组

Find the longest subarray in a given array that is either strictly increasing or strictly decreasing.

找出与数组相加的整数 I

Find the integer added to nums1 to make it equal to nums2 using an array-driven strategy.

特殊数组 I

Determine if an array is special by checking alternating parity for every adjacent pair in linear time.

找到稳定山的下标

Find the indices of stable mountains in an array of mountain heights based on a threshold.

检测相邻递增子数组 I

Check if an array contains two adjacent strictly increasing subarrays of length k using an array-driven approach efficie…

按下时间最长的按钮

Determine which button a child pressed the longest using an array-driven strategy to track time differences efficiently.

统计符合条件长度为 3 的子数组数目

Determine how many subarrays of length three satisfy a sum condition on their first and third elements in an array.

循环数组中相邻元素的最大差值

Find the maximum absolute difference between adjacent elements in a circular array using a straightforward array-driven …

好数字之和

The problem asks for the sum of all good numbers in an array based on specific conditions of neighboring elements.

到达每个位置的最小费用

Calculate the minimum swap costs to reach each position in a line using a precise array-driven strategy for efficiency.