C#练习题答案: 最大的对产品【难度：1级】--景越C#经典编程题库,1000道C#基础练习题等你来挑战

最大的对产品【难度:1级】:

答案1:

public class Kata
{
    public static int MaxProduct(int[] array)
    {
        int num1 = 0;
        int num2 = 0;

        foreach(var num in array)
        {
            if(num >num1)
            {
                num2 = num1;
                num1 = num;
            }
            else if (num > num2)
            {
                num2 = num;
            }
        }
        return num1 * num2;
    }
}​

答案2:

using System.Linq;
using System;

public class Kata
{
  public static int MaxProduct(int[] array)
  {
    int maxNum1 = array.Max(), maxNum2 = 0;
    for (int i = 0; i < array.Length; i++) {
      if (array[i] != maxNum1 &amp;&amp; maxNum2 < array[i]) {
        maxNum2 = array[i];
      }
    }
    return maxNum1 * maxNum2;
  }
}​

答案3:

using System;
using System.Linq;

public class Kata
{
    public static int MaxProduct(int[] array)
    {
        Array.Sort(array);
        var revers = array.Reverse().ToArray();
        var result = 1;

        for (int i = 0; i < 2; i++)
            result *= revers[i];

        return result;
    }
}​

答案4:

using System;
using System.Linq;
using System.Collections.Generic;
public class Kata
{
  public static int MaxProduct(int[] array)
  {
     List<int> list = array.ToList();
     int max = list.Max();
     list.Remove(max);
     return max * list.Max();
  }
}​

答案5:

using System.Collections.Generic;
using System.Linq;

public class Kata
{
    public static int MaxProduct(int[] array)
    {
        var result = new List<int>(array);
        int max = result.Max();
        result.Remove(max);

        return max * result.Max();
    }
}​

答案6:

using System.Linq;

public class Kata
{
  public static int MaxProduct(int[] array) => array.OrderByDescending(i => i).Take(2).Aggregate((x, n) => x * n);
}​

答案7:

public class Kata
{
  public static int MaxProduct(int[] array)
  {
    int max1 = 0;
    int max2 = 0;
    foreach (var i in array)
    {
      if (i > max1)
      {
        max2 = max1;
        max1 = i;
      }
      else if (i > max2)
        max2 = i;
    }
    return max1 * max2;
  }
}​

答案8:

using System;
using System.Linq;

public class Kata
{
  public static int MaxProduct(int[] array)
        {
            int[] arr = array.OrderByDescending(x => x).Take(2).ToArray();
            return arr[0]*arr[1];
        }
}​

答案9:

using System.Linq;

public class Kata
{
  public static int MaxProduct(int[] array)
  {
    return array.OrderByDescending(x => x).Take(2).Aggregate(1, (acc, val) => acc * val);
  }
}​

答案10:

using System.Linq;

public class Kata {
    public static int MaxProduct( int[] array ) {
        var pair = array.OrderByDescending( _ => _ ).Take( 2 ).ToArray( );
        return pair [ 0 ]*pair [ pair.Length - 1 ];
    }
}​