leetcode53求最大子序列参考(Mark Allen Weiss数据结构与算法分析)－－暴力解法

最新推荐文章于 2022-03-03 14:24:10 发布

masklxs

最新推荐文章于 2022-03-03 14:24:10 发布

阅读量290

点赞数

本文链接：https://blog.csdn.net/qq_42664961/article/details/103881626

版权

下面是Ｏ（ n ^２ )和Ｏ（n^3)的暴力解法：

暴力解法就是使用嵌套循环的方式
将所有的连续序列组合的结果计算出来，然后相互比较。

/**
 * 采用暴力求解的方式
 * 
*/
#include <stdio.h>
extern int maxSubSum(int *num, int length);
void main()
{
    int num[9] = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
    int sum = maxSubSum(num, 9);
    printf("%d\n", sum);
}
int maxSubSum(int *num, int length)
{
    int maxsubsum = num[0];
    for (int i = 0; i < length; i++)
    {
        for (int j = i; j < length; j++)
        {
            int thissum = 0;
            for (int k = i; k <= j; k++)
            {
                thissum += num[k];
            }
            if (thissum > maxsubsum)
            {
                maxsubsum = thissum;
            }
        }
    }
    return maxsubsum;
}

可以对复杂度进行优化到Ｏ(n^2)

/**
 * 采用暴力求解的方式
 * 
*/
#include <stdio.h>
extern int maxSubSum(int *num, int length);
void main()
{
    int num[9] = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
    int sum = maxSubSum(num, 9);
    printf("%d\n", sum);
}
int maxSubSum(int *num, int length)
{
    int maxsubsum = num[0];
    for (int i = 0; i < length; i++)
    {
        int thissum = 0;
        for (int j = i; j < length; j++)
        {

            thissum += num[j];

            if (thissum > maxsubsum)
            {
                maxsubsum = thissum;
            }
        }
    }
    return maxsubsum;
}