Array

本文主要包括 leetCode 题集里的两个题目，Two Sum1 和 Two Sum2 题目1： 1. Two Sum 1 # Given an array of integers, find two numbers such that they add up to a specific target number.

题目： # 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 product = 6.