1. Two Sum

最新推荐文章于 2019-06-02 15:51:25 发布

purple尘

最新推荐文章于 2019-06-02 15:51:25 发布

阅读量157

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/csCrazybing/article/details/78640818

版权

LeetCode 专栏收录该内容

10 篇文章 0 订阅

订阅专栏

水题。

class Solution {                          
    public:                               
        vector<int> twoSum(vector<int>& nums, int target) {
            vector<int> result;           
            int idx_i, idx_j;             
            bool solved = false;          
            for (idx_i = 0; idx_i < nums.size() - 1; idx_i++) {
                if (solved) {             
                    break;                
                }                         
                for (idx_j = idx_i+1; idx_j < nums.size(); idx_j++) {
                    if (solved) {         
                        break;            
                    }                     
                    if (nums[idx_i] + nums[idx_j] == target) {
                        result.push_back(idx_i);                                                                                                                                                                    
                        result.push_back(idx_j);
                        solved = true;       
                        break;            
                    }                     
                }                         
            }                             
                                          
            return result;                
        }                                 
};