Task description:
A non-empty array A consisting of N integers is given. A pair of integers (P, Q), such that 0 ≤ P ≤ Q < N, is called a slice of array A. The sum of a slice (P, Q) is the total of A[P] + A[P+1] + ... + A[Q].
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A consisting of N integers, returns the maximum sum of any slice of A.
For example, given array A such that:
A[0] = 3 A[1] = 2 A[2] = -6 A[3] = 4 A[4] = 0the function should return 5 because:
- (3, 4) is a slice of A that has sum 4,
- (2, 2) is a slice of A that has sum −6,
- (0, 1) is a slice of A that has sum 5,
- no other slice of A has sum greater than (0, 1).
Assume that:
- N is an integer within the range [1..1,000,000];
- each element of array A is an integer within the range [−1,000,000..1,000,000];
- the result will be an integer within the range [−2,147,483,648..2,147,483,647].
Complexity:
- expected worst-case time complexity is O(N);
- expected worst-case space complexity is O(N), beyond input storage (not counting the storage required for input arguments).
Solution:
找出一个列表中和最大的切片
下面是结果100%的:
def solution(p):#[3,2,-6,4,0]
lenp = len(p)
res = p[0]
last = res
for i in range(1,lenp):
last = max(p[i],p[i]+last)
if(last>res):
res = last
return res
但是我个人实在是理解不了啊。。。。我写的是下面的,正确率25%:
def solution(p):#[3,2,-6,4,0]
lenp = len(p)
d = {}
for i in range(lenp-1):#i = 0
slicesum = 0
l = []
for j in range(i+1,lenp+1): #j = 1
slicesum = sum(p[i:j])
l.append(slicesum)
d[i] = max(l)
return max(d.values())