码迷,mamicode.com
首页 >  
搜索关键字:could you do me a favor    ( 45411个结果
【LeetCode】Jump Game
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类:其他好文   时间:2014-05-19 08:23:07    阅读次数:223
【LeetCode】Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximu...
分类:其他好文   时间:2014-05-19 08:07:26    阅读次数:288
【leetcode】Best Time to Buy and Sell Stock
Say you have an array for which theithelement is the price of a given stock on dayi.If you were only permitted to complete at most one transaction (ie...
分类:其他好文   时间:2014-05-18 20:30:16    阅读次数:301
【leetcode】Longest Palindromic Substring
Given a stringS, find the longest palindromic substring inS. You may assume that the maximum length ofSis 1000, and there exists one unique longest pa...
分类:其他好文   时间:2014-05-18 19:39:55    阅读次数:355
CSS3+Js制作的一款响应式导航条
今天制作了一个响应式导航条,能够自动随着不同的屏幕分辨率或浏览器窗口大小的不同而改变导航条的样式,这里主要用到的就是CSS3的Media Query。具体可以查看浅谈响应式布局这篇文章,这里就不花费大量的篇幅介绍了,主要看一下这个导航条该怎么做。另外需要提到的是,ie6-ie8是不支持CSS3的Me...
分类:Web程序   时间:2014-05-18 19:33:42    阅读次数:403
rtx客户端绿化方法+组织架构更新延迟的解决方案
rtx客户端绿化方法:1-复制客户端安装目录。2-运行以下命令,注册dll文件和ocx文件,及rtx程序注册。rtx.exe /regserverren Config.dll c.dFor %%a in (*.dll) do regsvr32.exe /s %%aFor %%a in (*.ocx)...
分类:其他好文   时间:2014-05-18 19:29:18    阅读次数:480
JavaScript Patterns 2.3 - For loops
Do you know how to write the for-loop efficiently? Read this to get it. :)
分类:编程语言   时间:2014-05-18 19:24:37    阅读次数:382
Install MongoDB driver for PHP on XAMPP for Mac OSX
试了不少方法,最后还是这个最有效。[转自:http://thatsimplecode.com/install-mongodb-driver-for-php-on-xampp-for-mac-osx]You need to have the following installed in your Ma...
分类:数据库   时间:2014-05-18 19:10:28    阅读次数:305
linux 判断指定用户对指定目录具有的权限
脚本名:power.sh脚本内容:Shell代码 #!/bin/sh username3=$1 dir_name2=$2 # get existing directory file_path=$dir_name2 while true do if [ -d $fil...
分类:系统相关   时间:2014-05-18 18:49:24    阅读次数:319
Leetcode | 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 o...
分类:其他好文   时间:2014-05-18 02:34:57    阅读次数:352
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!