当前位置：网站首页>LeetCode-1. Two Sum

LeetCode-1. Two Sum

2022-08-10 16:26:00 【51CTO】


​ ​https://leetcode.com/problems/two-sum/description/​​

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

      
      
    
       
       
  • 1.
    • 
       
       
  • 2.
    • 
       
       
  • 3.
    • 
       
       
  • 4.
    •

题解：

      
      

       
       class 
       
       Solution {
       
       

       
       public:
       
       
    
       
       vector
       
       <
       
       int
       
       > 
       
       twoSum(
       
       vector
       
       <
       
       int
       
       >& 
       
       nums, 
       
       int 
       
       target) {
       
       
        
       
       int 
       
       i 
       
       = 
       
       0;
       
       
        
       
       int 
       
       j 
       
       = 
       
       nums.
       
       size();
       
       
        
       
       int 
       
       a, 
       
       b 
       
       = 
       
       0;
       
       
        
       
       for(
       
       i 
       
       = 
       
       0; 
       
       i 
       
       < 
       
       nums.
       
       size(); 
       
       i
       
       ++)
       
       
            
       
       for(
       
       j 
       
       = 
       
       nums.
       
       size() 
       
       - 
       
       1; 
       
       j 
       
       > 
       
       i; 
       
       j
       
       --){
       
       
                
       
       if(
       
       nums[
       
       i] 
       
       + 
       
       nums[
       
       j] 
       
       == 
       
       target){
       
       
                    
       
       a 
       
       = 
       
       i;
       
       
                    
       
       b 
       
       = 
       
       j;
       
       
                    
       
       break;
       
       
                }
       
       
            }
       
       
    
       
       return {
       
       a,
       
       b};
       
       
    }
       
       
};
      
      

      
      
    
       
       
  • 1.
    • 
       
       
  • 2.
    • 
       
       
  • 3.
    • 
       
       
  • 4.
    • 
       
       
  • 5.
    • 
       
       
  • 6.
    • 
       
       
  • 7.
    • 
       
       
  • 8.
    • 
       
       
  • 9.
    • 
       
       
  • 10.
    • 
       
       
  • 11.
    • 
       
       
  • 12.
    • 
       
       
  • 13.
    • 
       
       
  • 14.
    • 
       
       
  • 15.
    • 
       
       
  • 16.
    • 
       
       
  • 17.
    •

 

原网站

版权声明
本文为[51CTO]所创，转载请带上原文链接，感谢
https://blog.51cto.com/u_14150327/5564234

边栏推荐

猜你喜欢

随机推荐