2016年5月25日
LeetCode OJ 53. Maximum Subarray
摘要： Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2, 阅读全文
posted @ 2016-05-25 23:56 Black_Knight 阅读(351) 评论(0) 推荐(0)
LeetCode OJ 48. Rotate Image
摘要： You are given an n x n 2D matrix representing an image. Rotate the image by 90 degrees (clockwise). Follow up:Could you do this in-place? 【题目解析】 这个题目的 阅读全文
posted @ 2016-05-25 15:08 Black_Knight 阅读(463) 评论(0) 推荐(0)