题目描述：
LeetCode 483. Smallest Good Base
For an integer n, we call k>=2 a good base of n, if all digits of n base k are 1.
Now given a string representing n, you should return the smallest good ...
归档 2017年1月
[LeetCode]Smallest Good Base
[LeetCode]Predict the Winner
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 486. Predict the Winner
Given an array of scores that are non-negative integers. Player 1 picks one of the numbers from either end of the array followed by the player 2 and then player 1 and so on ...
[LeetCode]Construct the rectangle
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 492. Construct the rectangle
For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular ...
LeetCode Weekly Contest 16A解题报告
作者是
发布于
在
LeetCode.
LeetCode Weekly Contest 16A是LeetCode举办的第十九场正式周赛，共3道题目，比赛时长1.5小时。
比赛链接：https://leetcode.com/contest/leetcode-weekly-contest-16a/
题解列表：
[LeetCode]Increasing Subsequences
作者是
发布于
在
LeetCode.
题目描述：
LeetCode 491. Increasing Subsequences
Given an integer array, your task is to find all the different possible increasing subsequences of the given array, and the length of an increasing subsequence should be at least 2 .
Example:
Input: [4, 6 ...