[LeetCode] 908. Smallest Range I 最小區間
, we have some array B. Return the smallest possibl ...
原文：[LeetCode] 910. Smallest Range II 最小區間之二
Given an array A of integers, for each integer A i we need to chooseeither x K or x K , and add x to A i only once . After this process, we have some arrayB. Return the smallest possible difference b ...
2019-08-15 23:29 0 1106 推薦指數：
相關推薦
[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] 598. Range Addition II 范圍相加之二
Given an m * n matrix M initialized with all 0's and several update operations. Operations are r ...
[LeetCode] 963. Minimum Area Rectangle II 面積最小的矩形之二
Given a set of points in the xy-plane, determine the minimum area of any rectangle formed from the ...
[LeetCode] 483. Smallest Good Base 最小的好基數
the smallest good base of n in string format. Example 1: ...
[LeetCode] 154. Find Minimum in Rotated Sorted Array II 尋找旋轉有序數組的最小值之二
Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. ( ...
[LeetCode] Lonely Pixel II 孤獨的像素之二
Given a picture consisting of black and white pixels, and a positive integer N, find the number o ...
[LeetCode] Decode Ways II 解碼方法之二
A message containing letters from A-Z is being encoded to numbers using the following mapping way ...