hellochenlu的博客

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,1,−5,4], the contiguous subarray [4,−1,2,1]

用二分法，O(logn)。注意n /* */ #include "stdafx.h" #include using namespace std; class Solution_050_PowXn { public: double power(double x, int n) { if (n == 0) { return 1; } double v = pow

Given an array of strings, group anagrams together. For example, given: [“eat”, “tea”, “tan”, “ate”, “nat”, “bat”],  Return: [  [“ate”, “eat”,”tea”],  [“nat”,”tan”],  [“bat”]  ]  Note:  For

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?

Given a collection of distinct numbers, return all possible permutations. For example, [1,2,3] have the following permutations: [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1]. Subscrib