两数之和
<h1 align="center">两数之和</h1><p> </p>
<p align="left">给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。</p>
<p align="left"> </p>
<p align="left">你可以假设每种输入只会对应一个答案。但是，你不能重复利用这个数组中同样的元素。</p>
<p align="left"> </p>
<p align="left">示例:</p>
<p align="left"> </p>
<p align="left">给定 nums = , target = 9</p>
<p align="left"> </p>
<p align="left">因为 nums + nums = 2 + 7 = 9</p>
<p align="left">所以返回 </p>
<p align="left"> </p>
<p align="left">泉源：力扣（LeetCode）</p>
<p align="left">链接：https://leetcode-cn.com/problems/two-sum</p>
<p align="left">著作权归领扣网络所有。贸易转载请联系官方授权，非贸易转载请注明出处。</p>
1 using System;
2 namespace Wrox
3 {
4 public class TwoNum
5 {
6 static void Main()
7 {
8 Solution s = new Solution();
9 int[] result = new int;
10 int[] nums = new int;
11 int target = 9;
12 for (int i = 0; i < 10; i++)
13 {
14 nums = int.Parse(Console.ReadLine());
15 }
16 result = s.solueTwoNum(nums, target);
17 Console.WriteLine("[" + result + "," + result + "]");
18 Console.ReadLine();
19 return;
20 }
21 }
22 public class Solution
23 {
24 public int[] solueTwoNum(int[] nums, int target)
25 {
26 int Length = nums.Length;
27 int[] result = new int;
28 int flag = 1;
29 for (int i = 0; i < Length - 1; i++)
30 {
31 for (int j = 1; j < Length; j++)
32 {
33 if (nums + nums == target)
34 {
35 result = nums;
36 result = nums;
37 flag = 0;
38 }
39 if (flag == 0)
40 break;
41 }
42 if (flag == 0)
43 break;
44 }
45 return result;
46 }
47 }
48 }
<p><div align="center"></div></p>
<p> </p><br><br/><br/><br/><br/><br/>来源：<a href="https://www.cnblogs.com/asahiLikka/archive/2019/09/24/11580761.html" target="_blank">https://www.cnblogs.com/asahiLikka/archive/2019/09/24/11580761.html</a>
页:
[1]