码迷,mamicode.com
首页 >  
搜索关键字:follow    ( 4585个结果
LeetCode算法编程之连载三
1、题目 - Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it w...
分类:编程语言   时间:2014-11-06 01:56:43    阅读次数:221
[Leetcode] Remove Duplicates From Sorted Array II (C++)
题目:Follow up for "Remove Duplicates":What if duplicates are allowed at mosttwice?For example,Given sorted array A =[1,1,1,2,2,3],Your function should ...
分类:编程语言   时间:2014-11-05 01:51:40    阅读次数:224
[LeetCode] Linked List Cycle II
Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space?思路:...
分类:其他好文   时间:2014-11-04 10:40:26    阅读次数:143
[LeetCode] 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-11-03 20:42:18    阅读次数:204
ZOJ 3647 Gao the Grid(居然是暴力)
A n * m grid as follow: Count the number of triangles, three of whose vertice must be grid-points. Note that the three vertice of the triangle must not be in a line(the right picture is not a...
分类:其他好文   时间:2014-10-31 22:20:02    阅读次数:264
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?在原址上进行将矩阵旋转90度。如...
分类:其他好文   时间:2014-10-30 19:03:07    阅读次数:208
[LeetCode]Set Matrix Zeroes
Given a m x n matrix, if an element is 0, set its entire row and column to 0. Do it in place. click to show follow up. Follow up: Did you use extra space? A straight forward solution using O(m...
分类:其他好文   时间:2014-10-29 17:02:17    阅读次数:206
王立平--org.apache.subversion.javahl.ClientException: svn: E155011: Commit failed (details follow): svn
往svn服务器提交代码时候, 遇到错误:org.apache.subversion.javahl.ClientException: svn: E155011: Commit failed (details follow): svn: E155011: Directory 'D:\Android2\Picture\bin\dexedLibs' is out of date org.apache.s...
分类:编程语言   时间:2014-10-29 15:01:49    阅读次数:1689
POJ 1236 Network of Schools 强连通图
图论题目,需要解决问题: 1 使用Tarjan算法求子强连通图 2 标识顶点属于哪个子强连通图 3 计算各个子强连通图的零入度数和零出度数 图论中高级内容了,是有点难度的,不细心一点肯定会出错的。 这次本博主认真注解好几乎每个语句,希望大家可以follow我的程序。...
分类:Web程序   时间:2014-10-26 17:01:42    阅读次数:252
LeetCode: Rotate Image 解题报告
Rotate ImageYou 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?SOL...
分类:其他好文   时间:2014-10-25 21:29:02    阅读次数:317
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!