Ed
BAN USER@zr.roman: Correct me if I'm wrong, but your solution assumes that the input array is sorted. If it's not, the code will not work.
Here is what I came up with:
void find_combination(vector<int> arr, int sum)
{
vector<int> map(10);
//set default values to 0.
fill(map.begin(), map.end(), 0);
//1-insert items in map O(n)
for(int i=0;i<arr.size();i++)
{
map[ arr[i] ]=1; //key is the element and value is a flag 1.
}
for(int i=0;i<arr.size();i++)
{
if(map[ sum - arr[i] ] !=0)
{
cout<<arr[i]<<"-"<<sum-arr[i]<<endl;
map[sum-arr[i]]=0; //so we don't use this again
map[arr[i]]=0; //so we don't use this again
}
}
}
Here the solution in c++:
1-Reverse binary number
2-Add one.
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include<string>
using namespace std;
int main()
{
char bin[]="10011";
int n=(int)strlen(bin);
//1-reverse number
for(int i=0;i<n;i++)
{
if(bin[i]=='1')
bin[i]='0';
else
bin[i]='1';
}
//2-add one to the number
for(int i=n-1;i>=0;i--)
{
if(bin[i]=='0')
{
bin[i]='1';
break;
}
else
bin[i]='0';
}
cout<<"2's complement of is:"<<bin<<endl;
return 0;
}
- Ed February 17, 2016Here is the code in c++:
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
using namespace std;
class interval
{
public:
int start;
int end;
void set(int _start, int _end)
{
start=_start;
end=_end;
}
interval()
{
}
};
void merge_arrays_and_sort(interval a[10], interval b[10], interval sorted_res[20], int n, int m)
{
int co=0,i=0, j=0;
while(i<n && j<m)
{
if(a[i].start < b[j].start)
{
sorted_res[co]=a[i];
co++;
i++;
}
else
{
sorted_res[co]=b[j];
co++;
j++;
}
}
//left items in b
while(j<m)
{
sorted_res[co]=b[j];
j++;
co++;
}
//left items in a
while(i<n)
{
sorted_res[co]=a[i];
i++;
co++;
}
}
void merge_intervals(interval a, interval b, interval *new_interval)
{
interval bigger;
interval smaller;
if(a.start>b.start)
{
bigger.start=a.start;
bigger.end=a.end;
smaller.start=b.start;
smaller.end=b.end;
}
else
{
bigger.start=b.start;
bigger.end=b.end;
smaller.start=a.start;
smaller.end=a.end;
}
new_interval->start=smaller.start;
if(smaller.end>bigger.end)
{
new_interval->end=smaller.end;
}
else
{
new_interval->end=bigger.end;
}
}
bool overlap(interval a, interval b)
{
if(a.start<b.start)
{
if(b.start<a.end)
{
return true;
}
else
{
return false;
}
}
else if(a.start > b.start)
{
if(a.start>b.start)
{
if(a.start < b.end)
return true;
else
return false;
}
else
return false;
}
else //start equally at same minute
return true;
}
void combin_intervals(interval arr[20], interval res[20], int *co, int n)
{
*co=0;
int i=1;
interval current;
current.start=arr[0].start;
current.end=arr[0].end;
while(i<n)
{
if(overlap(current, arr[i])==true)
{
interval new_interval;
merge_intervals(current, arr[i], &new_interval);
current.start=new_interval.start;
current.end=new_interval.end;
i++;
}
else
{
res[*co]=current;
*co=*co+1;
current=arr[i];
i++;
}
}
//left item
res[*co]=current;
}
int main()
{
interval a[10];
interval b[10];
interval sorted_arr[20];
interval result[20];
int n=3, m=2, result_co=0;
a[0].set(3, 11);
a[1].set(17, 25);
a[2].set(58, 73);
b[0].set(6, 18);
b[1].set(40, 47);
//1-merge arrays and sort them
merge_arrays_and_sort(a, b, sorted_arr, n, m);
cout<<"Merged and Sorted array:\n";
for(int i=0; i<m+n; i++)
cout<<sorted_arr[i].start<<"-"<<sorted_arr[i].end<<", ";
//2-combin intervals
combin_intervals(sorted_arr, result, &result_co, m+n);
cout<<"\nFinal Result:\n";
for(int i=0; i<=result_co; i++)
cout<<result[i].start<<"-"<<result[i].end<<", ";
return 0;
}
Here is a working example in c++:
- Ed October 05, 2016