TwoSum

最新推荐文章于 2021-07-16 21:39:18 发布

cookcoder

最新推荐文章于 2021-07-16 21:39:18 发布

阅读量430

点赞数

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.csdn.net/cookcoder/article/details/49686961

版权

leetcode 专栏收录该内容

6 篇文章 0 订阅

订阅专栏


#include<iostream>
#include<string>
#include<vector>
#include<concurrent_vector.h>
using namespace std;
//先对原始数组进行排序，建立一个新的Id vector存储各个元素排序之前的序号，
//对小于target的部分用for循环判断是否为twosum和
class Solution {
public:
    vector<int> twoSum(vector<int>& nums, int target) {
		vector <int> data = nums;
		vector<int> twoSum;
		int n=nums.size();
		int jj=0;
		int kk = 0;
		int key =n-1;
		int i = 0;
		int j = 0;
		//int *id = (int *)malloc(sizeof(int)*n);
	    //int *sort =(int *)malloc(sizeof(int)*n);
		
		sort(nums.begin(),nums.end());


		int a =0;
	      while(a<key){
			  if (nums[a]+nums[key]>target)
				  key --;
			  else if (nums[a]+nums[key]<target)
				  a++;
			  else break;
		  }


			for(i=0;i<n;i++)
					if(data[i]==nums[a])
				   twoSum.push_back(i+1);
					else if(data[i]==nums[key])
					twoSum.push_back(i+1);
			if (twoSum[0]>twoSum[1])
				swap(twoSum[0],twoSum[1]);
		 
  		return twoSum;
        
    }


};


int main(){
	int iarray[]={-3,4,3,90};
	int count =sizeof(iarray)/sizeof(int);
	vector<int> nums (iarray ,iarray +count);
	
	vector<int>TwoSum;
	int target = 0;
	Solution a;
	TwoSum = a.twoSum(nums,target);
	for (int idx =0;idx<TwoSum.size();idx++)
		cout<<TwoSum[idx]<<endl;
	system("pause");
	return 1;
}