码迷,mamicode.com
首页 >  
搜索关键字:digits    ( 2164个结果
129 Sum Root to Leaf Numbers
129 Sum Root to Leaf Numbers链接:https://leetcode.com/problems/sum-root-to-leaf-numbers/ 问题描述: Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number.An...
分类:其他好文   时间:2015-08-19 07:08:42    阅读次数:176
[LeetCode] Add Digits 加数字
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3...
分类:其他好文   时间:2015-08-19 00:30:45    阅读次数:126
用链表表示的两个数相加
1 题目 You are giventwo linked lists representing two non-negative numbers. The digits are storedin reverse order and each of their nodes contain a single digit. Add the twonumbers and return it as a l...
分类:其他好文   时间:2015-08-18 22:47:47    阅读次数:204
NBUT 1219 Time
[1219] Time 时间限制: 1000 ms 内存限制: 131072 K 问题描述 Digital clock use 4 digits to express time, each digit is described by 3*3 characters (including”|”,”_”and” “).now given the current time, plea...
分类:其他好文   时间:2015-08-18 16:27:05    阅读次数:124
LeetCode(66)Plus One
题目Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is at the head of the list.分析该题目要求:将一整数按位存储在vector中,对其...
分类:其他好文   时间:2015-08-18 16:19:01    阅读次数:129
leetcode - Add Digits
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ...
分类:其他好文   时间:2015-08-18 16:05:11    阅读次数:164
CodeForces 124B Permutations
http://codeforces.com/problemset/problem/124/BDescriptionYou are givennk-digit integers. You have to rearrange the digits in the integers so that the ...
分类:其他好文   时间:2015-08-18 09:02:52    阅读次数:140
Java面试
Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3 + ...
分类:编程语言   时间:2015-08-17 19:08:01    阅读次数:117
[LeetCode]Add Digits
Add DigitsGiven a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is...
分类:其他好文   时间:2015-08-17 18:44:52    阅读次数:130
【LeetCode】Add Digits
题目:Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is like:3...
分类:其他好文   时间:2015-08-17 13:31:52    阅读次数:97
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!