码迷,mamicode.com
首页 >  
搜索关键字:digits    ( 2164个结果
[LeetCode#201] Bitwise AND of Numbers Range
Problem:Given a range [m, n] where 0 00111010101011...We can we reach the '1' in high index, all digits behind after it must change once. That's to s....
分类:其他好文   时间:2015-09-03 00:38:49    阅读次数:178
round函数
作用按指定的位数对数值进行四舍五入。语法:ROUND(number, num_digits)number 必需,要四舍五入的数字。num_digits 必需,位数,按此位数对number参数进行四舍五入。实例:=ROUND(2.15, 1)将 2.15 四舍五入到一个小数位2.2=ROUND(2.1...
分类:其他好文   时间:2015-09-02 17:11:55    阅读次数:148
[LeetCode#258]Add Digits
Problem:Given a non-negative integernum, repeatedly add all its digits until the result has only one digit.For example:Givennum = 38, the process is l...
分类:其他好文   时间:2015-09-01 10:23:24    阅读次数:150
hdu4333 Revolving Digits(扩展kmp+kmp最小循环节)
题目链接:点击打开链接 题意描述:给定一个字符串,可以把字符串的后x位移到字符串前面组成一个新的字符串?问对于所有的新组成的字符串中去掉重复的之后,比原串小的个数,等于的个数,大于的个数? 解题思路:扩展KMP(next1[i]数组含义:x[i···len-1]与x[0···len-1]的最长公共前缀) 分析:首先我们把字符串s复制一遍接到原字符串后面形成ss,这样在ss中以i(i>=0&&...
分类:其他好文   时间:2015-08-31 19:42:10    阅读次数:117
LeetCode OJ 之 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 + 8 = 11, 1 + 1 = 2. Since 2...
分类:其他好文   时间:2015-08-31 15:21:10    阅读次数:124
leetcode-258-Add Digits
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 + 8 = 11, 1 + 1 = 2. ...
分类:其他好文   时间:2015-08-31 13:36:38    阅读次数:168
[LeetCode][JavaScript]Reverse Integer
Reverse IntegerReverse digits of an integer.Example1:x = 123, return 321Example2:x = -123, return -321click to show spoilers.Have you thought about th...
分类:编程语言   时间:2015-08-29 23:04:29    阅读次数:350
NVIDIA DIGITS 学习笔记(NVIDIA DIGITS-2.0 + Ubuntu 14.04 + CUDA 7.0 + cuDNN 7.0 + Caffe 0.13.0)
本文记录了本人安装配置NVIDIA DIGITS步骤与方法,软件环境为Ubuntu 14.04 + CUDA 7.0 + cuDNN 7.0 + Caffe 0.13.0 + DIGITS 2.0。并以DIGITS自述文件中的例子为例,简单介绍了DIGITS的用法。...
分类:系统相关   时间:2015-08-29 17:01:45    阅读次数:694
NVIDIA DIGITS 学习笔记(NVIDIA DIGITS-2.0 + Ubuntu 14.04 + CUDA 7.0 + cuDNN 7.0 + Caffe 0.13.0)
转自:http://blog.csdn.net/enjoyyl/article/details/47397505?from=timeline&isappinstalled=0#10006-weixin-1-52626-6b3bffd01fdde4900130bc5a2751b6d1NVIDIA DI...
分类:系统相关   时间:2015-08-28 16:59:01    阅读次数:6331
*Sum root to leaf number
题目:Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which ...
分类:其他好文   时间:2015-08-28 12:45:15    阅读次数:125
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!