lazy标记
Time Limit:5000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u
Submit Status
Description
You have N integers, A1, A2, ... , AN. You need to deal with two kin...
分类：
其他好文 时间：
2014-07-28 15:53:03
阅读次数：
276
题目：Given two sorted integer arrays A and B, merge B into A as one sorted array.Note:You may assume that A has enough space (size that is greater or e....
分类：
编程语言 时间：
2014-07-28 14:47:23
阅读次数：
1108
// De?ne a DataSet with a single DataTable.DataSet dsInternal = new DataSet();dsInternal.Tables.Add("Users"); // De?ne two columns for this table.dsI....
分类：
Web程序 时间：
2014-07-28 11:20:50
阅读次数：
260
Given a linked list, swap every two adjacent nodes and return its head.
For example,
Given 1->2->3->4, you should return the list as 2->1->4->3.
Your algorithm should use only constant space. Y...
分类：
其他好文 时间：
2014-07-28 00:28:19
阅读次数：
273
题目There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should b...
分类：
其他好文 时间：
2014-07-27 22:49:39
阅读次数：
176
Description
A number is called a Mirror number if on lateral inversion, it gives the same number i.e it looks the same in a mirror. For example 101 is a mirror number while 100 is not.
Given two ...
分类：
其他好文 时间：
2014-07-27 11:10:22
阅读次数：
204
题目：Divide two integers without using multiplication, division and mod operator.题解：这道题我自己没想出来。。。乘除取模都不让用。。那只有加减了。。。我参考的http://blog.csdn.net/perfect888....
分类：
编程语言 时间：
2014-07-27 11:06:32
阅读次数：
303
题目：Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two e....
分类：
编程语言 时间：
2014-07-27 11:04:52
阅读次数：
278
题目：The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return a....
分类：
编程语言 时间：
2014-07-27 11:00:22
阅读次数：
262
There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be ...
分类：
其他好文 时间：
2014-07-27 09:53:12
阅读次数：
350
