https://leetcode.com/problems/number-of-digit-one/ Given an integer n, count the total number of digit 1 appearing in all non-negative integers less t ...
分类：
其他好文 时间：
2019-04-13 10:34:55
阅读次数：
119
410. Split Array Largest Sum Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continu ...
分类：
其他好文 时间：
2019-04-13 09:13:00
阅读次数：
162
Description: Implement int sqrt(int x). Compute and return the square root of x, where x is guaranteed to be a non-negative integer. Since the return ...
分类：
其他好文 时间：
2019-04-09 20:24:04
阅读次数：
148
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 contai ...
分类：
其他好文 时间：
2019-04-09 16:39:39
阅读次数：
167
Given a list, rotate the list to the right by k places, where k is non-negative. Example: class Solution { public ListNode rotateRight(ListNode head, ...
分类：
其他好文 时间：
2019-04-09 16:32:40
阅读次数：
120
Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even. Sort the array so that whenever A[i] ...
分类：
其他好文 时间：
2019-04-08 21:40:00
阅读次数：
186
Given an array which consists of non-negative integers and an integer m, you can split the array into m non-empty continuous subarrays. Write an algor ...
分类：
其他好文 时间：
2019-04-08 09:12:00
阅读次数：
122
1. 原始题目 You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and each of their node ...
分类：
其他好文 时间：
2019-04-07 12:50:04
阅读次数：
99
For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [ ...
分类：
其他好文 时间：
2019-04-05 09:24:39
阅读次数：
118
Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endp ...
分类：
其他好文 时间：
2019-04-05 09:22:42
阅读次数：
165
