AcwingLeetCode刷题 —— Week1

1 1.两数之和

• 了解为什么要这么做
• 先看思路再看代码
  1.两数之和
• 方法1：暴力算法

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