码迷,mamicode.com
首页 >  
搜索关键字:love you    ( 27955个结果
JavaScript获取地址栏中的参数
JavaScript获取地址栏中的参数 1、获取地址栏中的参数 (1)若地址栏中的地址是:         http://10.124.36.56:8080/CMOD/index.jsp?name=you&password=123456&type=student (2)获取地址栏中的最后一个参数type 2、实现的JS function getAddressURLPar...
分类:编程语言   时间:2014-06-11 07:01:30    阅读次数:288
Partition List
题目 Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the node...
分类:其他好文   时间:2014-06-11 06:28:41    阅读次数:364
LeetCode——
Add Two Numbers You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two...
分类:其他好文   时间:2014-06-11 00:35:15    阅读次数:243
【leetcode】Merge Sorted Array
Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or equal...
分类:其他好文   时间:2014-06-10 20:44:02    阅读次数:298
函数没定义
Q: #includeint main(){char A,B,C,D,s;float z;float x,y;printf("if you want add input A\nsubtraction input B\nThe multiplication input C\ndivision inpu...
分类:其他好文   时间:2014-06-10 20:16:29    阅读次数:243
I Remember The Very First Time I Saw A Body Opponent Bag
Unlike other promotional products, custom, these bags are? U? A useful tool for advertising because the ads joke Wielen fill the chest. If you want yo...
分类:其他好文   时间:2014-06-10 20:12:34    阅读次数:298
leetcode--Partition List
Given a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the origi...
分类:其他好文   时间:2014-06-10 12:06:09    阅读次数:205
DMV to track the temp file usage for SQLServer
There are three DMVs you can use to track tempdb usage:sys.dm_db_task_space_usagesys.dm_db_session_space_usagesys.dm_db_file_space_usageThe first two ...
分类:数据库   时间:2014-06-10 11:27:07    阅读次数:307
【leetcode】Climbing Stairs
问题: You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 分析: 该问题是符合斐波那契数列的,具体...
分类:其他好文   时间:2014-06-10 08:19:31    阅读次数:194
Climbing Stairs
题目 You are climbing a stair case. It takes n steps to reach to the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? 方法 从后往前求解...
分类:其他好文   时间:2014-06-10 07:38:21    阅读次数:171
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!