美文网首页
1. Two Sum

1. Two Sum

作者: witchzard | 来源:发表于2017-07-31 22:30 被阅读0次

    indicesof the two numbers such that they add up to a specific target.

    You may assume that each input would haveexactlyone solution, and you may not use thesameelement twice.

    Example:

    Given nums = [2, 7, 11, 15], target = 9,Because nums[0] + nums[1] = 2 + 7 = 9,return [0,1].

    O(n*n)时间复杂度

    相关文章

      网友评论

          本文标题:1. Two Sum

          本文链接:https://www.haomeiwen.com/subject/dxldlxtx.html