Given a non negative integernum, repeatedly add all its digits until the result has only one digit. Example: Follow up:Could you do it without any loop recursion in O runtime Hint: A naive implementa ...
2015-08-18 23:36 6 13996 推荐指数：
Given a non-empty string containing an out-of-order English representation of digits 0-9, output the digits in ascending order. Note: Input ...
X is a good number if after rotating each digit individually by 180 degrees, we get a valid numbe ...
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number ...
Given a non-negative integer N, find the largest number that is less than or equal to N with monotone increasing digits. (Recall ...
Given a positive integer N, return the number of positive integers less than or equal to N that ha ...
Given a non-negative integer n, count all numbers with unique digits, x, where 0 ≤ x < 10n. Example: Given n = 2, return 91. (The answer ...
Given an array of 4 digits, return the largest 24 hour time that can be made. The smallest 24 hour time is 00:00, and the largest is 23:59. ...
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes ...
