leetcode-01-two sum

class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
        vector<int> sum;
//        if( nums.size() == 0 || nums.size() == 1 ){
//            return 0;
//       }
        int k;
        int length = nums.size();

        for( int i = 0; i < length; i ++ ){
            k = target - nums[i];
            for( int j = 0; j < length; j ++ ){
                if( j != i && nums[j]  == k ){
                    sum.push_back(i);  
                    sum.push_back(j);  
                    return sum;
                }
            }
        }
    }
};

没有考虑hash方法，后续更新。时间复杂度为O(n^2)