题目描述:
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.
Note:
- The length of num is less than 105 ...
Given a non-negative integer num represented as a string, remove k digits from the number so that the new number is the smallest possible.
Note:
A binary watch has 4 LEDs on the top which represent the hours (0-11), and the 6 LEDs on the bottom represent the minutes (0-59).
Each LED represents a zero or one, with the least ...
Find the nth digit of the infinite integer sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ...
Note:
n is positive and will fit within the range of a 32-bit signed ...
LeetCode Weekly Contest 4是LeetCode举办的第三场正式周赛,共4道题目,比赛时长2.5小时。
比赛链接:https://leetcode.com/contest/leetcode-weekly-contest-4/
题解列表:
LeetCode 397. Integer Replacement
LeetCode 399. Evaluate Division
p> Equations are given in the format A / B = k
, where A
and B
are variables represented as strings, and k
is a real number (floating point number). Given some queries, return the answers. If ...