随笔分类 -  LintCode

Lintcode Recover Rotated Sorted Array
摘要：Given arotatedsorted array, recover it to sorted array in-place.Example[4, 5, 1, 2, 3]->[1, 2, 3, 4, 5]ChallengeIn-place, O(1) extra space and O(n) ti... 阅读全文
posted @ 2016-01-19 10:01 茜茜的技术空间 阅读(294) 评论(0) 推荐(0) 编辑
LintCode Merge Sorted Array II
摘要：Merge two given sorted integer arrayAandBinto a new sorted integer array.ExampleA=[1,2,3,4]B=[2,4,5,6]return[1,2,2,3,4,4,5,6]ChallengeHow can you opti... 阅读全文
posted @ 2016-01-19 04:32 茜茜的技术空间 阅读(181) 评论(0) 推荐(0) 编辑
LintCode 38. Search a 2D Matrix II
摘要：Write an efficient algorithm that searches for a value in an m x n matrix, return the occurrence of it.This matrix has the following properties:Intege... 阅读全文
posted @ 2016-01-16 13:58 茜茜的技术空间 阅读(402) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示