码迷,mamicode.com
首页 >  
搜索关键字:follow    ( 4585个结果
快乐人生的20条黄金法则
We all laugh. We all hurt. We all make mistakes. We all dream. That's life. It's a journey. Please follow these rules to make the journey of your life...
分类:其他好文   时间:2014-12-27 18:47:25    阅读次数:205
Lintcode-Max Tree
Given an integer array with no duplicates. A max tree building on this array is defined as follow:The root is the maximum number in the arrayThe left ...
分类:其他好文   时间:2014-12-27 06:37:51    阅读次数:132
LintCode-Topological Sorting
Given an directed graph, a topological order of the graph nodes is defined as follow:For each directed edge A-->B in graph, A must before B in the ord...
分类:其他好文   时间:2014-12-27 00:15:16    阅读次数:330
Linked List Cycle
Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space? 题目的意思是判断链表中有没有环 思路: 定义两个指针,一个慢指针,一个快指针,慢指针一次走两步,快指针一次走一步,如果有环,那么慢、快指针一...
分类:其他好文   时间:2014-12-26 20:20:32    阅读次数:191
linux
1:find.-name*http*-follow可查找当前目录下所有文件名称包含http的文件,包括连接到其他目录的文件-follow可查找软链接2:ls-R可以列出所有的文件,包括子目录的文件3:
分类:系统相关   时间:2014-12-26 18:50:00    阅读次数:184
leetcode 【 Linked List Cycle 】 python 实现
题目:Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space?代码:oj在线测试通过Runtime:416 ms 1 # Definitio...
分类:编程语言   时间:2014-12-26 16:37:09    阅读次数:220
The Class Loader Hierarchy--转载
Class loaders in the Application Server runtime follow a delegation hierarchy that is illustrated in the following figure and fully described inTable ...
分类:其他好文   时间:2014-12-25 18:08:03    阅读次数:141
LeetCode:Rotate Image
题目描述: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 思路:先将行顺序reverse,然后再对每个处于下三角区域的元素rotate。 ...
分类:其他好文   时间:2014-12-25 11:18:52    阅读次数:125
leetcode之图片(矩阵)旋转
题目: You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up: Could you do this in-place? 思路: 题目的关键在in-place,否则就太容易了,为了达到in-place只能...
分类:其他好文   时间:2014-12-24 22:46:59    阅读次数:138
[LeetCode]117.Populating Next Right Pointers in Each Node II
【题目】 Follow up for problem "Populating Next Right Pointers in Each Node". What if the given tree could be any binary tree? Would your previous solution still work? Note: You may only use...
分类:其他好文   时间:2014-12-24 20:13:31    阅读次数:151
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!