首页 > 其他 > 详细

LeetCode-1:Two Sum

时间:2017-10-28 13:24:07      阅读:241      评论:0      收藏:0      [点我收藏+]

【Problem】

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].

 

【Solution】

LeetCode-1:Two Sum

原文:http://www.cnblogs.com/shenxiaolin/p/7746510.html

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