码迷,mamicode.com
首页 >  
搜索关键字:letter    ( 1667个结果
Longest Substring Without Repeating Characters leetcode java
题目:Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letter....
分类:编程语言   时间:2014-07-28 11:34:30    阅读次数:265
理解css属性的继承和覆盖
首先,我们梳理一下哪些属性会被继承文本color 颜色,a元素除外direction 方向font 字体font-family 字体系列font-style 字体风格font-size 字体大小font-weight 字体粗细letter-spacing 字母间距line-height 行高text...
分类:Web程序   时间:2014-07-24 22:19:22    阅读次数:187
JXUST第二赛-C. Investment
John never knew he had a grand-uncle, until he received the notary's letter. He learned that his late grand-uncle had gathered a lot of money, somewhe...
分类:其他好文   时间:2014-07-22 00:26:36    阅读次数:281
css 字间距
接下来我们来介绍下css字间距,使用css来控制字与字之间距离,也叫css字间距方法。使用到的css样式属性单词text-indent抬头距离,letter-spacing字与字间距。Css字间距、div css字符间距样式实例1、text-indent设置抬头距离css缩进即对,对应div设置cs...
分类:Web程序   时间:2014-07-22 00:16:34    阅读次数:250
hdu 4601 Letter Tree 2013多校1-2
不容易啊。。一个小错误让我wa死了,找了一个晚上,怎么都找不到 最后是对拍代码找到的错误,发现当步数比较小的时候答案就是对的,比较大的时候就不对了 想到一定是什么地方越界了。。。 power[i] = (i64)(power[i - 1] * 26) % mod; 就是这行。。。 改成  power[i] = ((i64)power[i - 1] * 26) % mod;  就过了。。...
分类:其他好文   时间:2014-07-21 23:29:20    阅读次数:369
LeetCode——Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit st...
分类:其他好文   时间:2014-07-21 16:44:12    阅读次数:191
php杂记——2(数组的使用)
1.建立升序数组:range();$numarr1 = range(1,4); //(1,2,3,4)$numarr2 = range(1,10,2); //(1,3,5,7,9)$letter = range('a','z'); //('a','b','c'......'z')2.使用循环访问数组...
分类:Web程序   时间:2014-07-19 14:36:19    阅读次数:222
[leetcode]Letter Combinations of a Phone Number
Letter Combinations of a Phone NumberGiven a digit string, return all possible letter combinations that the number could represent.A mapping of digit ...
分类:其他好文   时间:2014-07-16 17:54:24    阅读次数:222
Java Word Ladder(字梯)
问题: Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that: Only one letter can be changed at a time Each intermediate wo...
分类:编程语言   时间:2014-07-12 19:21:38    阅读次数:290
Python--String
1、in的用法fruit = 'banana'for letter in fruit : print letter说明:letter此处为循环控制变量in可用于逻辑判断,a in fruit 为True2、String的部分输出,[a:b]输入index值为a到b-1的字符串,若b超过length,...
分类:编程语言   时间:2014-07-12 14:54:50    阅读次数:221
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!