leetcode
Evan_J
这个作者很懒,什么都没留下…
展开
-
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? 关键是要空间复杂度O(1),拿个小矩阵做做实验就知道了。 class Solution {原创 2013-08-13 11:02:09 · 353 阅读 · 0 评论 -
Leetcode Maximum Product Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest原创 2014-09-30 14:06:02 · 335 阅读 · 0 评论 -
Leetcode Best Time to Buy and Sell Stock
class Solution { public: int maxProfit(vector &prices) { if ( prices.size() int min,profit=0; min = prices[0]; for (int i = 0; i {原创 2014-09-30 13:19:07 · 317 阅读 · 0 评论 -
Max Points on a Line
Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.原创 2014-09-30 16:31:34 · 385 阅读 · 0 评论 -
Insertion Sort List
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *ser原创 2014-10-09 16:02:47 · 405 阅读 · 0 评论