码迷,mamicode.com
首页 >  
搜索关键字:no write has been do    ( 38312个结果
12:00的死亡游戏
#includeusing namespace std;int main(){int n,m,i,j,x[100],a[100],p;cout>n>>m;for(i=1;in){j=(x[i-1]+1)%n;}else{j=x[i-1]+1;}p=1;do{if(a[j]!=0){j++;if(j>...
分类:其他好文   时间:2014-05-23 02:47:17    阅读次数:211
[LeetCode] [Palindrome Number 2012-01-04]
Determine whether an integer is a palindrome. Do this without extra space.if use recursive, like check the first dig and last dig, then remove them, c...
分类:其他好文   时间:2014-05-23 02:45:15    阅读次数:230
leetcode Remove Nth Node From End of List
题目说:Try to do this in one pass 只用一遍遍历的话,p1先走n节点,p2再走,等到p1到达链表尾的时候p2正好在倒数第n+1个上面鸟 /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode...
分类:其他好文   时间:2014-05-23 01:52:29    阅读次数:331
LightOJ-1140-How Many Zeroes?
Jimmy writes down the decimal representations of all natural numbers between and including m and n, (m ≤ n). How many zeroes will he write down? Input Input starts with an integer T (≤ 11000), denot...
分类:其他好文   时间:2014-05-22 22:59:18    阅读次数:354
JS常用字符串处理方法总结
1.indexOf()方法,从前往后查找字符串位置,大小写敏感,从0开始计数。同理,lastIndexOf() 方法从后往前,两个方法对于相同的检索条件输出的结果是一样的 例如: var str="Hello World!" document.write(str.indexOf("Hello"))//输出0 document.write(str.indexOf("World"))/...
分类:Web程序   时间:2014-05-22 22:54:50    阅读次数:313
Same Tree
Given two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally identical an...
分类:其他好文   时间:2014-05-22 16:46:03    阅读次数:173
The new Portable Class Library for SQLite z
Microsoft Open Technologies has recently released a Portable Class Libraryfor SQLite. Thanks to it, we can use SQLite in the same way in all the suppo...
分类:数据库   时间:2014-05-22 15:06:51    阅读次数:428
第一章
体验js的魅力。js写入 htmldocument.write("This is a heading");document.write("This is a paragraph");完整代码:JavaScript:对事件作出反应点击这里alert() 函数在 JavaScript 中并不常用,但它对...
分类:其他好文   时间:2014-05-21 19:59:25    阅读次数:213
【Leetcode】Reverse Linked List II
Reverse a linked list from positionmton. Do it in-place and in one-pass.For example:Given1->2->3->4->5->NULL,m= 2 andn= 4,return1->4->3->2->5->NULL.No...
分类:其他好文   时间:2014-05-21 19:08:08    阅读次数:195
poj3295(模拟)
Tautology Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 9078   Accepted: 3477 Description WFF 'N PROOF is a logic game played with dice. Each die has six...
分类:其他好文   时间:2014-05-21 13:53:44    阅读次数:259
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!