Code-Practice/2Sum.cpp at master · DrorFried/Code-Practice · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


class Solution {

private:    int My_binSearch(vector<int>& nums, int start, int end, int target) //returns the index of targget in the sorted nums, or -1 if not found
    {
        if (start==end)
        {
         if (nums[start]==target)
             return start;
         else
             return -1;

        }

        int mid = (start+end)/2; // could also do: start+(end-start)/2

        int ans1 = My_binSearch(nums, start, mid, target);
        if (ans1 == -1)
            return My_binSearch(nums, mid, end, target);
        else
            return ans1;


    }

public:


   vector<int> twoSum(vector<int>& nums, int target) {

     vector<int>:: iterator i;
     vector<int>:: iterator j;
     vector<int>sol(2);

    for (i=nums.begin();i!=nums.end();i++)
    {

        for (j=i+1;j!=nums.end();j++)
        {

         if(*i+*j == target)
         {

              int ind1 = std::distance(nums.begin(),i);
              sol[0]=ind1;
              int ind2 = std::distance(nums.begin(),j);
              sol[1]=ind2;
         }

        }

    }

   return sol;

    }


    vector<int> twoSum2(vector<int>& nums, int target) {

     vector<int>sol(2);

    for (int i=0;i<nums.size();i++)
    {

        for (int j=i+1;j<nums.size();j++)
        {

         if(nums[i]+nums[j] == target)
         {


              sol[0]=i;
              sol[1]=j;
         }

        }

    }

   return sol;

    }

     vector<int> twoSum3(vector<int>& nums, int target) {

     vector<int>sol(2);

     sort(nums.begin(),nums.end());

      int ind = Binsearch(nums,target);

       cout<<"bin:"<<ind<<endl;

     /* for (int k=nums[0];k<nums.size();k++)
               cout<<k<<":"<<nums[k]<<endl;
       */

     /* for (int k=nums[0];k<nums.size();k++)
      {
        int first = nums[k];
        int second = target-first;
        if (second < first)
            break;
       */


   return sol;

    }


    int Binsearch(vector<int>& nums, int target)
    {
        cout<<"size:"<<nums.size()<<endl;
        return My_binSearch(nums,0,nums.size()-1,target);

    }


};


int main(){


    int arr[]={1,4,16,9,3,25,0,14};
    int size = sizeof(arr)/sizeof(int);
    vector<int> sum(arr,arr+size);
    int target = 13;
    vector<int>sol(2);

    Solution s;
   sol=   s.twoSum3(sum,target);


        //cout<<"solution:"<<endl;
       cout<<sol[0]<<","<<sol[1]<<endl;

         //cout<<"size:"<<sol.contains()<<endl;
         /*
           vector<int>:: iterator k;
           for (k=sol.begin();k!=sol.end();k++)
               cout<<"d:"<<(*k)<<endl;
    */


 return 0;


}