Leetcode解题一：给定一个整形target，要求在数组中找到两个数相加等于target,数组中数字不能重复不能等于target。

using System;

namespace ConsoleApp2
{
    class Program
    {
        static void Main(string[] args)
        {
            int[] a = { 11, 15, 2, 7 };
            int[] aa;
            aa = TwoSum(a, 9);
            Console.Write(aa[0]);
            Console.Write(aa[1]);
        }
        public static int[] TwoSum(int[] nums, int target)
        {
            int[] mubiao = new int[2];
            for (int i = 0; i < nums.Length; i++)//遍历所有数据
            {
                for (int b = i+1; b <nums.Length; ++b)//每个数据后的所有数据
                {
                    if (target == nums[i] + nums[b])
                    {
                        Console.WriteLine("超级骑士???");
                        mubiao[0] = i;
                        mubiao[1] =b;
                        return mubiao;
                    }
                }
            }
            return null;
        }

    }
}