53. Maximum Subarray
来源:互联网 发布:js声明json数组 编辑:程序博客网 时间:2024/05/22 15:54
问题描述:
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
.
解题思路:
该题是给出一个序列,然后让我们找到子序列之和最大的子序列的和。
#include"stdio.h"
int pos;
int maxSubArray(int *nums,int numsSize){
int sum=0;
int res=nums[0];
int i;
for(i=0;i<numsSize;i++){
if(sum<0){
sum=0;
int pos;
int maxSubArray(int *nums,int numsSize){
int sum=0;
int res=nums[0];
int i;
for(i=0;i<numsSize;i++){
if(sum<0){
sum=0;
}
sum+=nums[i];
sum+=nums[i];
if(res<=sum){
res=sum;
pos=i;
}
}
pos=i;
}
}
return res;
}
}
void main(){
int a[9]={-2,1,-3,4,-1,2,1,-5,4};
int max,i,count=0;
int a[9]={-2,1,-3,4,-1,2,1,-5,4};
int max,i,count=0;
max=maxSubArray(a,9);
int sum2=a[pos];
int sum2=a[pos];
for(i=pos-1;i>0;i--)
{
if(sum2<max)
{
{
if(sum2<max)
{
sum2=sum2+a[i];
count++;
}
}
count++;
}
}
for(i=count;i<=pos;i++)
printf("%d,",a[i]);
printf("该子序列之和为该序列中最大,其和为:%d",max);
}
printf("%d,",a[i]);
printf("该子序列之和为该序列中最大,其和为:%d",max);
}
阅读全文
0 0
- [LeetCode]53.Maximum Subarray
- LeetCode --- 53. Maximum Subarray
- 53.Maximum Subarray
- [Leetcode] 53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 53.Maximum Subarray
- 53. Maximum Subarray
- 【leetcode】53. Maximum Subarray
- [leetcode] 53.Maximum Subarray
- 【leetcode】53. Maximum Subarray
- 53. Maximum Subarray
- LeetCode 53. Maximum Subarray
- 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray LeetCode
- 53. Maximum Subarray
- [LeetCode]53. Maximum Subarray
- 53. Maximum Subarray
- hunnu11547(dp)
- DTCoreText的集成
- ReactNative开发——Clipboard
- 淘淘商城系列——使用JsonView来格式化json字符串
- Js计算时间差(天、小时、分钟、秒)
- 53. Maximum Subarray
- git 常用命令
- Socket通信时报错java.net.ConnectException: Connection refused
- 去掉数组中重复的数字
- 13.创建活动、布局、活动关联布局、注册活动
- FZU1205 之 小鼠迷宫问题
- webpack 学习经验1
- 实习随手记-MFC多线程分解复制文件
- javaWeb服务详解(含源代码,测试通过,注释) ——applicationContext-dao.xml