首页 > 其他 > 详细

LeetCode Array Easy 1. Two Sum

时间:2018-04-19 12:56:49      阅读:172      评论:0      收藏:0      [点我收藏+]

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Example:

Given nums = [2, 7, 11, 15], target = 9,

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].

给定一个数组和一个目标,计算数组中任意两个数的和,如果等于目标,则返回这两个数字的下标

C#实现

public class Solution {
    public int[] TwoSum(int[] nums, int target) {
        int[] result = new int[2];
            for(int i = 0; i< nums.Length - 1; i++){
                for(int j = i+1; j < nums.Length; j++){
                    if((nums[i] + nums[j]) == target){
                    result[0]= i;
                    result[1] = j;
                }
            }
        }
        return result;
    }
}

技术分享图片

结束

 

LeetCode Array Easy 1. Two Sum

原文:https://www.cnblogs.com/c-supreme/p/8881573.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!