码迷,mamicode.com
首页 >  
搜索关键字:b. ohana cleans up    ( 7828个结果
leetcode--Rotate Image
You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?public class Soluti...
分类:其他好文   时间:2014-06-18 21:54:54    阅读次数:232
[LeetCode] Search in Rotated Sorted Array II
Follow up for "Search in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?Write a function to...
分类:其他好文   时间:2014-06-18 20:54:36    阅读次数:202
vsftp服务
vsftp服务要求:1.禁止匿名用户登录2.修改FTP默认端口为21213.禁锢本地用户在自己家目录4.本地用户登录到/data/ftproot目录5.up上传/下载,down仅下载。拒绝所有用户,登录包括匿名用户6.最多20个并发,每IP地址最多2个并发7.限制下载速度限制为100KB/s#FTP虚拟账户实现步骤:..
分类:其他好文   时间:2014-06-16 16:23:39    阅读次数:420
【Leetcode】Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7}, ...
分类:其他好文   时间:2014-06-15 15:17:43    阅读次数:192
【Leetcode】Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null. Follow up: Can you solve it without using extra space? 思路:由【Leetcode】Linked List Cycle可知,利用一快一慢...
分类:其他好文   时间:2014-06-15 14:23:38    阅读次数:288
TOP命令各个参数代表意义详解
Top命令是Linux下常用的系统性能分析工具,能实时查看系统中各个进程资源占用情况。top - 16:24:25 up 284 days, 4:59, 1 user, load average: 0.10, 0.05, 0.01Tasks: 115 total, 1 running, 114 sl...
分类:其他好文   时间:2014-06-15 06:01:13    阅读次数:310
[LeetCode] Remove Duplicates from Sorted Array II
Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice?For example, Given sorted array A = [1,1,1,2,2,3],Your function should...
分类:其他好文   时间:2014-06-14 16:08:32    阅读次数:200
[LeetCode] Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up: Can you solve it without using extra space?比...
分类:其他好文   时间:2014-06-14 15:48:59    阅读次数:217
[LeetCode] Search in Rotated Sorted Array II [36]
题目 Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run-time complexity? How and why? Write a function to determine if a given target is in the array. 原题链接(点我) 解题思路 这题和Search in Rotated Sorted Array问题类似,...
分类:其他好文   时间:2014-06-14 12:44:18    阅读次数:266
【Leetcode】Unique Paths II
Follow up for "Unique Paths": Now consider if some obstacles are added to the grids. How many unique paths would there be? An obstacle and empty space is marked as 1 and 0 respectively in the...
分类:其他好文   时间:2014-06-14 12:02:12    阅读次数:229
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!