[LeetCode] 910. Smallest Range II 最小區間之二
Given an array `A` of integers, for each integer `A[i]` we need to choose either `x = -K` or `x = K`, and add `x` to `A[i] (only once)`. After ...
原文：[LeetCode] 908. Smallest Range I 最小區間
Given an array A of integers, for each integer A i we may choose any x with K lt x lt K , and add x to A i . After this process, we have some arrayB. Return the smallest possible difference between t ...
2019-08-07 22:20 0 1011 推薦指數：
相關推薦
[LeetCode] 632. Smallest Range Covering Elements from K Lists 覆蓋K個列表元素的最小區間
You have k lists of sorted integers in ascending order. Find the smallest range that includes at least one number from each of the k lists. We ...
[LeetCode] 483. Smallest Good Base 最小的好基數
the smallest good base of n in string format. Example 1: ...
[LeetCode] 1125. Smallest Sufficient Team 最小的必要團隊
In a project, you have a list of required skills req_skills, and a list of people. The ith person people[i] contains a list of skills ...
[LeetCode] 327. Count of Range Sum 區間和計數
Given an integer array nums, return the number of range sums that lie in [lower, upper] inclusive.Range sum S(i, j) is defined as the sum ...
[LeetCode] 302. Smallest Rectangle Enclosing Black Pixels 包含黑像素的最小矩陣
An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are connected, i.e., there is only one ...
[LeetCode] Find Smallest Letter Greater Than Target 找比目標值大的最小字母
Given a list of sorted characters letters containing only lowercase letters, and given a target letter target, find the smallest element ...
[LeetCode] 1015. Smallest Integer Divisible by K 可以整除K的最小整數
Given a positive integer K, you need to find the length of the smallest positive integer N such that N is divisible by K, and N only contains ...