In addition to the charts that follow, you might want to consider the Frequently Asked Questions section for a selection of common questions about Mon...
分类：
数据库 时间：
2015-01-22 13:11:53
阅读次数：
306
题目链接：https://oj.leetcode.com/problems/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 u...
分类：
其他好文 时间：
2015-01-22 09:32:37
阅读次数：
193
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...
分类：
其他好文 时间：
2015-01-22 01:40:55
阅读次数：
130
You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?可以找规律 得出映射关系，（i,j）=...
分类：
其他好文 时间：
2015-01-21 23:52:48
阅读次数：
133
The question: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 ex...
分类：
其他好文 时间：
2015-01-20 06:09:54
阅读次数：
178
题目：You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?代码：oj测试通过Runtime...
分类：
编程语言 时间：
2015-01-18 23:59:42
阅读次数：
467
本文是在学习中的总结，欢迎转载但请注明出处：http://blog.csdn.net/pistolove/article/details/42833739
Given a linked list, determine if it has a cycle in it.
Follow up:
Can you solve it without using extra space?
思路：...
分类：
其他好文 时间：
2015-01-18 10:35:13
阅读次数：
157
The question:Follow upfor "Find Minimum in Rotated Sorted Array":What ifduplicatesare allowed?Would this affect the run-time complexity? How and why?S...
分类：
其他好文 时间：
2015-01-18 07:06:07
阅读次数：
338
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 i...
分类：
其他好文 时间：
2015-01-16 23:38:32
阅读次数：
178
题目: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 ...
分类：
编程语言 时间：
2015-01-16 23:36:59
阅读次数：
686
