zoukankan      html  css  js  c++  java
  • 每日一道题2014/7/24

    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内可以正常出结果,很迷茫,昨天的题目也是。

    因为弱小,所以要变强,因为不想灭亡,所以选择战斗
  • 相关阅读:
    ArcMap导出图层属性为excel表
    ArcMap面转为线
    vue(18)声明周期函数
    geoserver发布mbtiles文件
    docker部署geoserver
    vue(17)组件插槽slot的使用
    vue(16)父子组件之间直接相互访问
    MySQL常用查询语句积累
    数据库的基本设计
    HashMap学习
  • 原文地址:https://www.cnblogs.com/cmjason/p/3865545.html
Copyright © 2011-2022 走看看