程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> LeetCode(62)-Two Sum

LeetCode(62)-Two Sum

編輯:C++入門知識

LeetCode(62)-Two Sum


題目:

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.

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

Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
UPDATE (2016/2/13):
The return format had been changed to zero-based indices. Please read the above updated description carefully.

思路:

題意:給定一個互不相同的整數數組nums,給定一個目標值target,求兩個索引值,相應的值的和等於target 首先排除nums == null和nums.length < 2,返回null,至於其他的情況可以用兩個循環解決

代碼:

public class Solution {
    public int[] twoSum(int[] nums, int target) {
        int[] result = new int[2]; 
        int n = nums.length;
        if(n < 2 || nums == null){
            return null;
        }
        for(int i = 0;i < n;i++){
            for(int j = i+1;j < n;j++){
                if(nums[i] + nums[j] == target){
                    result[0] = i;
                    result[1] = j;
                    return result;
                }
            }
        }
        return null;
    }
}

  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved