Meshing/main.cpp at master · Alegriabaile/Meshing · 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
//
// Created by ale on 19-3-6.
//
#include <iostream>
#include <vector>
#include <algorithm>
#include <opencv2/opencv.hpp>

using namespace cv;
using namespace std;

class Solution {
public:
    vector<vector<int>> result;
    vector<int> candidates;

    vector<vector<int>> combinationSum(vector<int>& candidates, int target) {
        sort(candidates.begin(), candidates.end());

        this->candidates.assign(candidates.begin(), candidates.end());
        for(int i=candidates.size()-1; i>=0; --i)
        {
            if(candidates[i] == target)
                result.push_back(vector<int>(1, target));
            else if(candidates[i] < target)
            {
                vector<int> temp;
                temp.push_back(candidates[i]);
                findComb(temp, i, target-candidates[i]);
            }
        }

        return result;
    }

    void findComb(vector<int> candidate, int k, int target)
    {
        if(target == 0)
        {
            result.push_back(candidate);
            return;
        }

        if(target < 0 || k < 0)
            return;

        if(target > 0)
        {
            if(candidates[k] > target)
                findComb(candidate, k-1, target);

            if(candidates[k] <= target )
            {

                findComb(candidate, k-1, target);//not push candidate
                candidate.push_back(candidates[k]);
                findComb(candidate, k, target-candidates[k]);//push candidate
                findComb(candidate, k-1, target-candidates[k]);
            }


        }

    }
};

int main()
{
/*
    Point v1(1, 0);
    Point v2(0, 1);
    Point v3;
    cout<<v1.cross(v2)<<", "<<v2.cross(v1)<<endl;


    list<int> ls{1,2,3, 4, 5};

    list<int>::iterator it_begin = ls.begin();
    list<int>::iterator it_end = ls.end();

    cout<<"*it_begin "<<*it_begin<<endl;
    cout<<"*it_end "<<*it_end<<endl;
    cout<<"*std::prev(it_begin) "<<*std::prev(it_begin)<<endl;
    cout<<"*std::next(it_end) "<<*std::next(it_end)<<endl;

    cout<<endl;
    for(list<int>::iterator it = ls.begin(); it!= ls.end(); ++it)
    {
        if(std::prev(it) == ls.end())
            cout<<" std::pre(it) ==  ls.end()"<<endl;
        cout<<"*it: "<<*it<<" *it->pre: "<<*std::prev(it)
        <<" *it->pre->pre: "<<*std::prev(std::prev(it))
        <<" *it->pre->pre->pre: "<<*std::prev(std::prev(std::prev(it)))<<endl;
    }

    for(list<int>::iterator it = ls.begin(); it!= ls.end(); ++it)
    {
        if(std::next(it) == ls.end())
            cout<<" std::next(it) ==  ls.end()"<<endl;
        cout<<"*it: "<<*it<<" *it->next: "<<*std::next(it)
        <<" *it->next->next: "<<*std::next(std::next(it))
        <<" *it->next->next->next: "<<*std::next(std::next(std::next(it)))
        <<endl;
    }
    cout<<endl;

*/
    /*
    int scalar(100);
    Point offset(200, 200);
    //vector<Point> vertices{Point(0, 0)*scalar+offset, Point(1, 0)*scalar+offset, Point(2, 1)*scalar+offset, Point(1, 2)*scalar+offset, Point(0, 1)*scalar+offset};

vector<Point> vertices{
        Point(0,0), Point(1,0), Point(2,1), Point(3.0), Point(4,2),
        Point(2,4), Point(3,2), Point(0,1), Point(2,1)
    };
    vector<Point> vertices{
            Point(3,1), Point(1,3), Point(-1,2), Point(1,2),
            Point(1,1), Point(0,0), Point(1,0)};

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

    vector<Point> triangles;
    triangulateSimplePolygon(vertices, triangles);
    cout<<"triangles: "<<endl;
    for(int i=0; i<triangles.size(); ++i)
        cout<<triangles[i];
    cout<<endl;

    Mat image(800, 800, CV_8UC3, Scalar(255,255,255));
    for(int i=0; i<triangles.size()/3; ++i)
    {
        cv::line(image, triangles[i*3+0]*scalar+offset, triangles[i*3+1]*scalar+offset, cv::Scalar(0,0,255), 1, CV_AA);
        cv::line(image, triangles[i*3+1]*scalar+offset, triangles[i*3+2]*scalar+offset, cv::Scalar(0,0,255), 1, CV_AA);
        cv::line(image, triangles[i*3+2]*scalar+offset, triangles[i*3+0]*scalar+offset, cv::Scalar(0,0,255), 1, CV_AA);
        cv::circle(image, triangles[i*3+0]*scalar+offset, 2, Scalar(0, 0, 0), -1, FILLED);
        cv::circle(image, triangles[i*3+1]*scalar+offset, 2, Scalar(0, 0, 0), -1, FILLED);
        cv::circle(image, triangles[i*3+2]*scalar+offset, 2, Scalar(0, 0, 0), -1, FILLED);
    }

    flip(image, image, 0);
    imshow("image", image);
    waitKey();*/

    Solution solution;
    vector<int> candidates = {2, 3, 6, 7};
    int i = 0;
    int target = 7e1;
    solution.combinationSum(candidates, target);

    int a = 100;
    int b = 300;
    a = a^b;
    b = a^b;
    a = a^b;
    cout<<a<<" "<<b<<endl;
    return 0;
}