Maximum Subarray
来源:互联网 发布:gd单片机官网 编辑:程序博客网 时间:2024/06/08 13:33
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]
has the largest sum = 6
.
=============================================================
有时得承认,自己真的很菜。
刚开始拿到题的时候,直接就写了一个三层for,提交后,超时
后来写了一个双层for,感觉差不多,确实可以运行出来,代码如下:
习惯性的写完百度一下,发现到处都是O(n)的解法,有点惭愧了
开始想不通sum小于0的时候为什么直接丢弃,后来想到一个例子{-1,4,3}
sum开始等于-1,加上4的时候,自己是负数,所以还不如直接丢弃
1 0
- maximum subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Maximum Subarray
- Android ADB server didn't ACK * failed to start daemon *
- StringUtils用法
- STL算法
- eclipse初次打开JVM terminated.Exit Code=2
- 数字图像基础
- Maximum Subarray
- hdu 5217(线段树)
- 【LeetCode】Letter Combinations of a Phone Number
- 线程同步(1)——synchronized
- 图像的基本运算
- excel表结构通过vb导入到pdm里
- 频域处理基础
- petuum
- 【转】Java Annotation详解