每日一道题2014/7/24

标签：style   blog   os   strong   io   2014   for   re   

Two Sum

Given an array of integers, find two numbers such that they add up to a specific target number.

The function twoSum should return indices of the two numbers such that they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

class Solution {
public:
    vector<int> twoSum(vector<int> &numbers, int target) {
        int index1=1,index2=2;

        for(vector<int>::iterator iter1=numbers.begin();iter1!=numbers.end();++iter1)
        {
            for(vector<int>::iterator iter2=iter1+1;iter2!=numbers.end();++iter2)
            {
                if(*iter1+*iter2==target)
                {
                    cout<<"index1="<<index1<<", index2="<<index2<<endl;
                    break;
                }
                index2++;
            }
            index1++;
        }
  
    }
};

结果：卡在{-3,4,3,90},0的input上，但是在visual studio内可以正常出结果，很迷茫，昨天的题目也是。

每日一道题2014/7/24,布布扣,bubuko.com

每日一道题2014/7/24

标签：style   blog   os   strong   io   2014   for   re   

原文地址：http://www.cnblogs.com/cmjason/p/3865545.html