[LeetCode] Base 7 基數七
Given an integer, return its base 7 string representation. Example 1: Example 2: Note: The input will be in range of [-1e7, 1e7 ...
原文：[LeetCode] 483. Smallest Good Base 最小的好基數
For an integer n, we call k gt agood baseof n, if all digits of n base k are . Now given a string representing n, you should return the smallest good base of n in string format. Example : Example : E ...
2017-03-26 06:08 3 5064 推薦指數：
相關推薦
[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 ...
[LeetCode] 908. Smallest Range I 最小區間
, we have some array B. Return the smallest possibl ...
[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 ...
[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 ...
[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 bl ...
[LeetCode] 865. Smallest Subtree with all the Deepest Nodes 包含最深結點的最小子樹
Given a binary tree rooted at `root`, the *depth* of each node is the shortest distance to the root ...