Example #1
0
TEST(case1, test1) {
    Solution sol;
    typedef vector<int> V;
    V v1,v2,r;
    v1 = {1,2,4,0,0};
    v2 = {3,5};
    r = {1,2,3,4,5};
    sol.merge(v1,3,v2,2);
    EXPECT_EQ(r, v1);
    v1 = {0,0,3,0,0,0,0,0,0};
    v2 = {-1,1,1,1,2,3};
    r = {-1,0,0,1,1,1,2,3,3};
    sol.merge(v1,3,v2,6);
    EXPECT_EQ(r, v1);
}
Example #2
0
int main(int argc, char** argv) {
    Solution s;
    vector<Interval> aa;
    aa.push_back(Interval(1,4));
    aa.push_back(Interval(0,4));
    s.merge(aa);
}
int main()
{
    vector<Interval> intervals;
    Interval *inte = new Interval( 4, 5 );
    intervals.push_back( *inte );
    inte = new Interval( 2, 3 );
    intervals.push_back( *inte );
    inte = new Interval( 8, 10 );
    intervals.push_back( *inte );
    inte = new Interval( 15, 18 );
    intervals.push_back( *inte );
    inte = new Interval( 1, 16 );
    intervals.push_back( *inte );

    int a[105][2] = {{362,367},{314,315},{133,138},{434,443},{202,203},{144,145},{229,235},{205,212},{314,323},{128,129},{413,414},{342,345},{43,49},{333,342},{173,178},{386,391},{131,133},{157,163},{187,190},{186,186},{17,19},{63,69},{70,79},{386,391},{98,102},{236,239},{195,195},{338,338},{169,170},{151,153},{409,416},{377,377},{90,96},{156,165},{182,186},{371,372},{228,233},{297,306},{56,61},{184,190},{401,403},{221,228},{203,212},{39,43},{83,84},{66,68},{80,83},{32,32},{182,182},{300,306},{235,238},{267,272},{458,464},{114,120},{452,452},{372,375},{275,280},{302,302},{5,9},{54,62},{237,237},{432,439},{415,421},{340,347},{356,358},{165,168},{15,17},{259,265},{201,204},{192,197},{376,383},{210,211},{362,367},{481,488},{59,64},{307,315},{155,164},{465,467},{55,60},{20,24},{297,304},{207,210},{322,328},{139,142},{192,195},{28,36},{100,108},{71,76},{103,105},{34,38},{439,441},{162,168},{433,433},{368,369},{137,137},{105,112},{278,280},{452,452},{131,132},{475,480},{126,129},{95,104},{93,99},{394,403},{70,78}};

    for( int i = 0; i < 105; i++ )
    {

        inte = new Interval( a[i][0], a[i][1] );
        intervals.push_back( *inte );
    }

    Solution sol;
    sol.print_vec( sol.merge( intervals ) );



    return 0;
}
Example #4
0
int main()
{
    Solution sol;
    std::vector<Interval> a{Interval(1, 4),Interval(0, 2),Interval(3, 5)};
    sol.merge(a);
    return 0;
}
 void RunTests()
 {
     Solution s;
     int s1[] = { 0, 0, 0, 0 };
     int s2[] = { 1, 0, 0, 0 };
     s.merge(s1, 0, s2, 1);
 }
/*************************在leetcode上直接提交以上代码即可******************************/
int main()
{
	int M,m;
	vector<int> nums1;
	cout << "输入nums1的整数个数: " << endl;
	cin >> M;
	cout << "输入nums1各整数: " << endl;
	for(int i = 0; i < M; i++)
	{
		int temp_num;
		cin >> temp_num;
		nums1.push_back(temp_num);
	}
	cout << "输入m: " << endl;
	cin >> m;
	int N,n;
	vector<int> nums2;
	cout << "输入nums2的整数个数: " << endl;
	cin >> N;
	cout << "输入nums2各整数: " << endl;
	for(int i = 0; i < N; i++)
	{
		int temp_num;
		cin >> temp_num;
		nums2.push_back(temp_num);
	}
	cout << "输入n: " << endl;
	cin >> n;
	Solution solu;
	solu.merge(nums1,m,nums2,n);

	for(int i = 0; i < nums1.size(); i++)
		cout << nums1[i] << endl;

}
int main() {
    Solution s;
    int a[100] = {};
    int b[1] = {2};
    s.merge(a, 0, b, 1);
    return 0;
}
Example #8
0
int main(){
	struct Interval iv1;
	iv1.start = 1;
	iv1.end = 3;
	struct Interval iv2;
	iv2.start = 8;
	iv2.end = 10;
	struct Interval iv3;
	iv3.start = 2;
	iv3.end = 6;
	struct Interval iv4;
	iv4.start = 15;
	iv4.end = 18;
	vector<Interval> mVector;
	mVector.push_back(iv1);
	mVector.push_back(iv2);
	mVector.push_back(iv3);
	mVector.push_back(iv4);
	Solution tmp;
	vector<Interval> a = tmp.merge(mVector);
	cout << a.size() << endl;
	for(int i = 0; i < a.size(); i++){
		cout << a[i].start << " " << a[i].end << endl;
	}
	return 0;
}
int main()
{
	std::vector<int> v = {0,1,2,3};
    for(vector<int>::iterator it = v.begin() ; it != v.end() ; ++it)
        std::cout << *it << " ";

	vector<int>::iterator st = v.end();

	v.erase( v.begin() + 2 );
	vector<int>::iterator vt = v.end();

	vector<Interval> vec;
	vec.push_back(Interval(1,3));
	vec.push_back(Interval(2,6));
	vec.push_back(Interval(8,11));
	vec.push_back(Interval(13,15));

	for(vector<Interval>::iterator it = vec.begin(); it != vec.end() ; ++it)
        std::cout << "( "<< it->start <<", " << it->end  << ") ";
	std::cout << endl;

	Solution s;
	s.merge(vec);

	for(vector<Interval>::iterator it = vec.begin(); it != vec.end() ; ++it)
        std::cout << "( "<< it->start <<", " << it->end  << ") ";
	std::cout << endl;
}
Example #10
0
int main()
{
	srand((unsigned int)time(NULL));
	int A[30],B[10];
	for(int i = 0; i < 30; i++)
		A[i] = 0;
	for(int i = 0; i < 20; i++)
	{
		A[i] = rand() % 100;
	}
	for(int i = 0; i < 10; i++)
	{
		B[i] = rand() % 100;
	}
	select(A,20);
	select(B,10);
	for(int i = 0; i < 20; i++)
		cout<<A[i]<<" ";
	cout<<endl;
	for(int j = 0; j < 10; j++)
		cout<<B[j]<<" ";
	cout<<endl;
	Solution s;
	s.merge(A,20,B,10);
	for(int i = 0; i < 30; i++)
		cout<<A[i]<<" ";
	cout<<endl;

}
int main() {
    Solution sol;

    vector<Interval> vec = {{1,3},{2,6},{8,10},{15,18}};
    printIntervalVec(sol.merge(vec));

    return 0;
}
Example #12
0
//我觉得这道题目的意义在于自动排序。不传入递增还是递减你怎么判断是增还是减法。
int main()
{
	Solution tst;
	int A[10]={};
	int B[5]={1,2,3,4,5};
	tst.merge(A,0,B,5);
	return 0;
}
int main()
{
	int A[10]={1};
	int B[]={};
	Solution sol;
	sol.merge(A,1,B,0);
	return 0;
}
Example #14
0
int main()
{
	Solution sol;
	std::vector<Interval> intervals;
	intervals.push_back(Interval(1, 4));
	intervals.push_back(Interval(2, 3));
	std::vector<Interval> res = sol.merge(intervals);
	return 0;
}
Example #15
0
int main(){
	vector<Interval> intervals = {Interval(1, 4), Interval(2, 3)};
	Solution soln;
	vector<Interval> result = soln.merge(intervals);
	for(unsigned int i = 0; i < result.size(); i++){
		cout << "[" << result[i].start << ", " << result[i].end << "] ";
	}
	cout << endl;
}
Example #16
0
int main(int argc, const char *argv[])
{
   Solution sol;
   vector<Interval> input;
   input.push_back(Interval(1, 4));
   input.push_back(Interval(2, 5));
   cout << sol.merge(input) << endl;
   return 0;
}
Example #17
0
int main()
{
	Solution solution;
	int input_A[3]={1,4,6};
	int input_B[3]={2,2,3};
	
	solution.merge(input_A,3,input_B,3);
	
	return 0;
}
Example #18
0
int main()
{
    Solution so;
    int A[10] = {2, 5, 6, 8};
    int B[] = {1, 7, 9, 10, 11};
    so.merge(A, 4, B, 5);
    for (int i = 0; i < sizeof(A)/sizeof(A[0]); i++)
        cout<<A[i]<<endl;
    cout<<endl;
    return 0;
}
Example #19
0
int main()
{
    int A[10] = {11,13 ,15 ,17 ,19 };
    int B[] = {2, 4 ,6 ,8 ,10};

    Solution sl;
    printArray(A, sizeof(A)/sizeof(A[0]));
    sl.merge(A, 5, B, sizeof(B)/sizeof(B[0]));
    printArray(A, sizeof(A)/sizeof(A[0]) );
    return 0;
}
Example #20
0
int main()
{
    int a[2]= {2};
    int b[]= {1};
    Solution s;
    s.merge(a,1,b,1);
    for(int i=0; i<2; i++)
        cout<<"  "<<a[i];
    cout<<endl;
    return 0;
}
Example #21
0
int main(void)
{
	vector<int> nums1;
	nums1.push_back(1);
	nums1.push_back(3);
	vector<int> nums2;
	nums2.push_back(2);
	Solution engine;
	engine.merge(nums1, nums1.size(), nums2, nums2.size());
	return 0;
}
int main()
{
	vector<int>nums1 = { 3,5,6,8,9,11,15,17,18,20 };
	vector<int>nums2 = { 1,4,7,12,16,18,22,25 };
	Solution sol;
	sol.merge(nums1, 10, nums2, 8);
	for (auto i : nums1)
	{
		cout << i << " ";
	}
}
int main(int argc, char *argv[]) {
	int A[20]={1,2,3,7,9};
	int B[3]={2,5,6};
	Solution sol;
	sol.merge(A,5,B,3);
	for(int i=0;i<8;i++)
	{
		cout<<A[i]<<endl;
	}
	
}
Example #24
0
int main()
{
    vector<Interval> intervals = {Interval(2,3),Interval(4,6),Interval(8,10),Interval(4,16)};
    Solution s;
    vector<Interval> res = s.merge(intervals);
    for(auto iter = res.begin(); iter != res.end(); iter++) {
        cout<<"["<<iter->start<<","<<iter->end<<"]"<<" ";
    }
    cout<<endl;
    return 0;
}
Example #25
0
TEST(MergeSortedArray, case1){
    Solution* s = new Solution();
    
    int a[] = {3,0,0};
    int b[] = {1,2};
    
    s->merge(a, 1, b, 2);
    ASSERT_EQ(1, a[0]);
    ASSERT_EQ(2, a[1]);
    ASSERT_EQ(3, a[2]);
}
Example #26
0
int main()
{
	Solution s;
	vector<int> a = { 1, 2, 3, 0, 0, 0 };
	vector<int> b = { 4, 5, 6 };
	s.merge(a, 3, b, 3);
	for (auto i : a)
		cout << i << " ";

	getchar();
	return 0;
}
Example #27
0
int main(int argc, const char *argv[]) {
    auto test = [](std::vector<Interval> vi) {
        Solution solution;
        std::vector<Interval> intervals(vi);
        auto result = solution.merge(intervals);
        std::copy(result.begin(), result.end(), std::ostream_iterator<Interval>(std::cout, ", "));
    };
    
    test({Interval(15, 18), Interval(8, 10), Interval(1, 3), Interval(2, 6)});
    
    return 0;
}
Example #28
0
int main()
{
	Solution s;
	vector<Interval> result = s.merge(vector<Interval>({ Interval(1, 3), Interval(2, 6), Interval(8, 10), Interval(15, 18) }));
	for (auto i : result)
	{
		cout << "[" << i.start << "," << i.end << "] ";
	}

	getchar();
	return 0;
}
Example #29
0
int main()
{
    Solution s;
    vector<int> v1, v2;
    v1.push_back(0);
    v2.push_back(1);
    s.merge(v1, 0, v2, v2.size());
    printV(v1);

    
    return 0;
}
Example #30
0
int main() {
	int a[4] = { 1,0};
	int b[2] = { 2 };
	vector<int> v1(a, a+2);
	vector<int> v2(b, b + 1);
	Solution s;
	s.merge(v1, 1, v2, 1);
	for (int i = 0; i < v1.size(); i++) {
		cout << v1[i] << endl;
	}
	return 1;
}