【题目】
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:
Integers in each row are sorted from left to right.
The first integer of each row is greater than the last integer of the previous ...
                            
                            
                                分类:
其他好文   时间:
2014-06-05 08:28:43   
                                阅读次数:
321
                             
                    
                        
                            
                            
                                eclipse git 报错:the current branch is not configured for pull No value for key branch.xxx.merge found in configuration
如图:
这是因为 在用gui创建分支的时候 config文件没有创建branch
在config文件加上
[branch "xxx"]
...
                            
                            
                                分类:
系统相关   时间:
2014-06-05 05:15:19   
                                阅读次数:
326
                             
                    
                        
                            
                            
                                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 equal...
                            
                            
                                分类:
其他好文   时间:
2014-06-04 18:18:08   
                                阅读次数:
259
                             
                    
                        
                            
                            
                                class Solution {public: ListNode 
*mergeKLists(vector &lists) { ListNode* merged = NULL; for (int i=0; ival 
val) { n...
                            
                            
                                分类:
其他好文   时间:
2014-06-03 13:26:43   
                                阅读次数:
219
                             
                    
                        
                            
                            
                                class Solution {public: void merge(int A[], int 
m, int B[], int n) { int mi = m + n - 1; int ai = m - 1; int bi = n - 1; ...
                            
                            
                                分类:
其他好文   时间:
2014-06-03 12:57:28   
                                阅读次数:
217
                             
                    
                        
                            
                            
                                class Solution {private: static int 
compare(const Interval& a, const Interval& b) { return a.start 
merge(vector &intervals) { vector...
                            
                            
                                分类:
其他好文   时间:
2014-06-03 12:32:23   
                                阅读次数:
228
                             
                    
                        
                            
                            
                                【题目】
Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.
For example,
Given 1->2->3->3->4->4->5, return 1->2->5.
Given 1->1->1->2->3, return 2->3.
【题意】
给定一个有序链表,删出其中重复出现的值...
                            
                            
                                分类:
其他好文   时间:
2014-05-31 21:14:11   
                                阅读次数:
333
                             
                    
                        
                            
                            
                                一、什么 RedisREmoteDIctionaryServer,简称 
Redis,是一个类似于Memcached的Key-Value存储系统。相比Memcached,它支持更丰富的数据结构,包括string(字符串)、list(链表)、set(集合)、zset(sorted 
set --有序集合)...
                            
                            
                                分类:
Web程序   时间:
2014-05-31 01:37:58   
                                阅读次数:
390
                             
                    
                        
                            
                            
                                Given an array where elements are sorted in 
ascending order, convert it to a height balanced BST./** * Definition for binary 
tree * struct TreeNode { ...
                            
                            
                                分类:
其他好文   时间:
2014-05-30 15:10:23   
                                阅读次数:
227
                             
                    
                        
                            
                            
                                DescriptionAn ascending sorted sequence of 
distinct values is one in which some form of a less-than operator is used to 
order the elements from smalle...
                            
                            
                                分类:
其他好文   时间:
2014-05-30 14:31:10   
                                阅读次数:
297