在一个整数数组中寻找符合A+B=C的组合，使C为最大

来源：互联网发布：红外人流量计数单片机编辑：程序博客网时间：2024/06/06 19:39

private void button1_Click(object sender, EventArgs e)
{
    #region 初始化数组
    int[] array = new int[arrayLength];
    Random random = new Random(1000); // 固定随机种子，使大家测试数据一致
    for (int i = 0; i < array.Length; i++)
        array[i] = random.Next(); // <<<<<<<<random.Next(arrayLength * 10); ->> random.Next();
    #endregion 初始化数组

    int A, B, C;
    long tickCount = Environment.TickCount;
    Search(array, out A, out B, out C);
    Console.WriteLine("计算结果：A={0} B={1} C={2}，耗时:{3}",
        A, B, C, Environment.TickCount - tickCount);
}

public static void Search(int[] array, out int A, out int B, out int C)
{
    A = -1;
    B = -1;
    C = -1;
    Array.Sort(array);
    for (int i = array.Length - 1; i > 1; i--)
    {
        C = array[i];
        for (int j = i - 1; array[j] > C / 2; j--)
        {
            A = array[j];
            B = C - A;
            if (Array.IndexOf(array, B, 0, j) > 0)
            {
                return;
            }
        }
    }
}