七乐彩胆码 一休彩票1xcp,凉凉 下载,东莞移动网上营业厅
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.
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; } }
如对本文有疑问,请在下面进行留言讨论,广大热心网友会与你互动!! 点击进行留言回复
如何在没有core文件的情况下用dmesg+addr2line定位段错误
用QT制作3D点云显示器——QtDataVisualization
网友评论