网站介绍:题目:Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.A subarray is a contiguous part of an array.给定一个整数数组 nums ,找到一个具有最大和的连续子数组(子数组最少包含一个元素),返回其最大和。Example 1:Input: _53. 最大子序和
- 链接地址:https://blog.csdn.net/weixin_53790347/article/details/119982779
- 链接标题:53. (Maximum Subarray)最大子序和_53. 最大子序和-CSDN博客
- 所属网站:blog.csdn.net
- 被收藏次数:9159
- 网站标签:53. 最大子序和