Find Minimum in Rotated Sorted Array II Total Accepted: 23090 Total Submissions: 73108 My Submissions Question Solution
Follow up for “Find Minimum in Rotated Sorted Array”:
What if duplicates are a...
分类：
其他好文 时间：
2015-04-15 23:26:18
阅读次数：
188
Removing Images and SetsOptimize the size of an asset catalog by removing unused images or sets.通过删除不用的图片或图片集优化一个asset catalog的大小。Do one of the follow...
分类：
其他好文 时间：
2015-04-15 21:13:13
阅读次数：
107
题目：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-04-15 09:28:28
阅读次数：
113
题目：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-04-13 20:47:32
阅读次数：
129
??
语法分析之自顶向下语法分析概述与三个重要概念的集合
自顶向下语法分析概述：
基本思想
检查程序是否为文法的句子
按定义从开始符号出发能推导出程序
一个一个尝试，选择规则没有依据。
例子：
Z→aBb[1]|aD[2]
B→b[3]|bB[4]
...
分类：
其他好文 时间：
2015-04-13 09:37:15
阅读次数：
210
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...
分类：
其他好文 时间：
2015-04-12 10:40:06
阅读次数：
107
https://leetcode.com/problems/n-queens-ii/Follow up for N-Queens problem.Now, instead outputting board configurations, return the total number of dist...
分类：
其他好文 时间：
2015-04-11 22:21:58
阅读次数：
164
题目：
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 us...
分类：
其他好文 时间：
2015-04-11 11:53:04
阅读次数：
192
You are given annxn2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?solution:找规律 int[i]...
分类：
其他好文 时间：
2015-04-11 06:33:05
阅读次数：
121
题目描述：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 spac...
分类：
其他好文 时间：
2015-04-10 19:52:27
阅读次数：
106
