sum求和类题目

时间：2017-01-12 12:48:41 阅读：241 评论：0 收藏：0 [点我收藏+]

今天看到这道题目：http://www.cnblogs.com/charlesblc/p/5930311.html

题目地址：https://leetcode.com/problems/split-array-largest-sum/

很好，也很难。开拓了思路，用二分法来查找，通过结果备选集合来处理。

	#	Title	Acceptance	Difficulty
	454	4Sum II	43.3%	Medium
	437	Path Sum III	38.7%	Easy
	416	Partition Equal Subset Sum	37.5%	Medium
。	410	Split Array Largest Sum	32.2%	Hard
	404	Sum of Left Leaves	45.7%	Easy
	377	Combination Sum IV	41.6%	Medium
	373	Find K Pairs with Smallest Sums	29.8%	Medium
	371	Sum of Two Integers	51.4%	Easy
	364	Nested List Weight Sum II	50.4%	Medium
	363	Max Sum of Rectangle No Larger Than K	32.1%	Hard
	339	Nested List Weight Sum	59.8%	Easy
	327	Count of Range Sum	28.9%	Hard
	325	Maximum Size Subarray Sum Equals k	41.6%	Medium
	308	Range Sum Query 2D - Mutable	19.8%	Hard
	307	Range Sum Query - Mutable	18.4%	Medium
	304	Range Sum Query 2D - Immutable	22.7%	Medium
	303	Range Sum Query - Immutable	26.2%	Easy
	259	3Sum Smaller	40.6%	Medium
	228	Summary Ranges	28.1%	Medium
	216	Combination Sum III	41.9%	Medium
	209	Minimum Size Subarray Sum	28.6%	Medium
	170	Two Sum III - Data structure design	22.7%	Easy
	167	Two Sum II - Input array is sorted	48.2%	Medium
	129	Sum Root to Leaf Numbers	35.2%	Medium
	124	Binary Tree Maximum Path Sum	25.0%	Hard
	113	Path Sum II	31.4%	Medium
	112	Path Sum	32.9%	Easy
	64	Minimum Path Sum	37.2%	Medium
	40	Combination Sum II	31.3%	Medium
	39	Combination Sum	35.7%	Medium
	18	4Sum	25.7%	Medium
	16	3Sum Closest	30.5%	Medium
	15	3Sum	20.9%	Medium
	1	Two Sum	29.9%	Easy

原文：http://www.cnblogs.com/charlesblc/p/6275819.html

踩

(0)

评论一句话评论（0）