001.Max2：使用递归求解数组中最大的两个元素

最新推荐文章于 2022-03-25 21:45:04 发布

dos diosas

最新推荐文章于 2022-03-25 21:45:04 发布

阅读量245

点赞数 1

分类专栏： # 算法杂例文章标签：算法

本文链接：https://blog.csdn.net/dosdiosas_/article/details/105443669

版权

算法杂例专栏收录该内容

35 篇文章 0 订阅

订阅专栏

#include <iostream>
#include <algorithm>

using namespace std;
//****递归求解数组里面最大的两个数字******//
void max2(int a[], int lo, int hi, int &x1, int &x2)
{
    if (lo + 2 == hi)
    {
        if (a[lo] >= a[hi-1])
        {
            x1 = a[lo];
            x2 = a[hi-1];
            return;
        }
        else
        {
        	x1 = a[hi - 1];
        	x2 = a[lo];
        	return;
        }
    }
    if (lo + 3 == hi)
    {
        x1 = max(a[lo], max(a[lo + 1], a[hi - 1]));
        x2 = a[lo] + a[lo + 1] + a[hi - 1] - x1 - min(a[lo], min(a[lo + 1], a[hi - 1]));
        return;
    }
    int mi = (lo + hi) >> 1;
    int x1L, x2L;
    max2(a, lo, mi, x1L, x2L);
    int x1R, x2R;
    max2(a, mi, hi, x1R, x2R);
    if (a[x1L] > a[x1R])
    {
        x1 = x1L;
        x2 = (a[x2L] > a[x1R]) ? x2L : x1R;
        return;
    }
    else
    {
    	x1 = x1R;
    	x2 = (a[x1L] > a[x2R]) ? x1L : x2R;
    	return;
    }
}

int main()
{
    int a[10] = { 8, 3, 30, 25, 10, 22, 31, 35, 21, 19 };
    int x1=0, x2=0;
    max2(a, 0, 10, x1, x2);
    cout << "x1 = " << x1 << endl;
    cout << "x2 = " << x2 << endl;
    return 0;
}