OUT\REF\PARAMS

OUT:可以返回多个数据，

ref：相当于C语言中的指针。

params：可变参数，但可变参数，只能做为形参列表最后一个。

//Rextester.Program.Main 是代码入口函数，不要改变它.
//编译版本 4.0.30319.17929 for Microsoft (R) .NET Framework 4.5

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;

namespace Rextester
{
    public class Program
    {
        public static void Main(string[] args)
        {
            //你的代码...
            int[] numbers = { 1, 2, 3, 4, 5, 6, 7, 8, 9 };
            int[] numbers1 = { 1, 2, 3, 4, 5, 6, 7, 8, 9 ,10};
            int max1;
            int min1;
            GetMaxMin(out max1, out min1, numbers);

            Console.WriteLine("MAX:{0}",            max1);
            Console.WriteLine("MIN:{0}",min1);
            Swap(ref max1, ref min1);
            Console.WriteLine("after swap:MAX:{0},MIN{1}.", max1,min1);
            int sum = GetSum(8,9);
            Console.WriteLine(sum);
            sum = GetSum(numbers);
            Console.WriteLine(sum);
            sum = GetSum(numbers1);
            Console.WriteLine(sum);
            Console.WriteLine("Hello, world!");
        }
        public static void Swap(ref int tmpa, ref int tmpb)
        {
            int sw;
            sw = tmpa;
            tmpa = tmpb;
            tmpb = sw;
        }
        public static int[] GetMaxMin(out int max, out int min, int[] nums)
        {
            int[] ret = new int[4];
            ret[0] = nums[0];//max
            ret[1] = nums[0];//min
            ret[2] = 0;//sum
            string name = "Dog";
            for (int i = 0; i < nums.Length; i++)
            {
                if (nums[i] > ret[0])
                    ret[0] = nums[i];
                if (nums[i] < ret[0])
                    ret[0] += nums[i];
                ret[2] += nums[i];
            }
            max = ret[0];
            min = ret[1];
            return ret;

        }
        public static int GetSum(params int[] n)
        {
            int sum = 0;
            for(int i = 0; i <n.Length;i++)
                sum += n[i];
            return sum;
        }
    }
}

 

MAX:9
MIN:1
after swap:MAX:1,MIN9.
17
45
55
Hello, world!