cjmemory
BAN USER1 #include <iostream>
2 #include <vector>
3
4 using namespace std;
5
6 void printComp(int arr[], int len, vector<int> &vec, int N) {
7 if(arr==0||len<0||N<0) return;
8
9 if(0 == N) {
10 for(int i = 0; i < vec.size(); i++)
11 cout << vec[i] << " ";
12 cout << endl;
13 return;
14 }
15 /*
16 for(int i = 0; i < len; i++) {
17 vec.push_back(arr[i]);
18 printComp(arr+i, len-i, vec, N-arr[i]);
19 vec.pop_back();
20 }
21 */
22 vec.push_back(arr[0]);
23 printComp(arr, len, vec, N-arr[0]);
24 vec.pop_back();
25 printComp(arr+1, len-1, vec, N);
26 }
27
28
29 int main() {
30 int N = 8;
31 int arr[N/2];
32 for(int i = 0; i < N/2; i++)
33 arr[N/2-1-i] = 2*i+1;
34
35 for(int i = 0; i < N/2; i++)
36 cout << arr[i] << "->";
37 cout << endl;
38
39 vector<int> vec;
40 printComp(arr, N/2, vec, N);
41
42 return 0;
43 }
1 #include <iostream>
2 #include <vector>
3
4 using namespace std;
5
6 void printComp(int arr[], int len, vector<int> &vec, int N) {
7 if(arr==0||len<0||N<0) return;
8
9 if(0 == N) {
10 for(int i = 0; i < vec.size(); i++)
11 cout << vec[i] << " ";
12 cout << endl;
13 return;
14 }
15 for(int i = 0; i < len; i++) {
16 vec.push_back(arr[i]);
17 printComp(arr+i, len-i, vec, N-arr[i]);
18 vec.pop_back();
19 }
20 }
21
22
23 int main() {
24 int N = 8;
25 int arr[N/2];
26 for(int i = 0; i < N/2; i++)
27 arr[N/2-1-i] = 2*i+1;
28
29 for(int i = 0; i < N/2; i++)
30 cout << arr[i] << "->";
31 cout << endl;
32
33 vector<int> vec;
34 printComp(arr, N/2, vec, N);
35
36 return 0;
37 }
31 void BST::createBSTfromSortedList(BSTNode *&pRoot, Node *head, int len) {
32 if(head==0||len<=0) return;
33
34 int midNum = (len-1)/2;
35 int i = 0;
36 Node *p = head;
37 while(i<midNum) {
38 p = p->next;
39 i++;
40 }
41 if(pRoot==0) pRoot = new BSTNode();
42 pRoot->value = p->value;
43 createBSTfromSortedList(pRoot->left, head, midNum);
44 createBSTfromSortedList(pRoot->right, p->next, len-midNum-1);
45 }
1 #include <iostream>
2 #include <vector>
3
4 #define INT_MAX 11
5 using namespace std;
6
7 int largetSubSequence(int arr[], int len, vector<int>& vec) {
8 int *intmap = new int[INT_MAX];
9
10 for(int i = 0; i < len; i++) {
11 intmap[arr[i]] = 1;
12 }
13
14 int last = -1;
15 int count = 0;
16 int maxCount = 0;
17 for(int i = 0; i < INT_MAX; i++) {
18 if(last == -1) {
19 last = intmap[i];
20 count++;
21 } else {
22 if(intmap[i]==1) {
23 count++;
24 } else {
25 count = 0;
26 }
27 last = intmap[i];
28 }
29 if(count > maxCount)
30 maxCount = count;
31 }
32
33 delete intmap;
34 return maxCount;
35 }
36
37 int main() {
38 int arr[] = {1,6,10,4,7,9,5};
39 vector<int> vec;
40
41 cout << largetSubSequence(arr, sizeof(arr)/sizeof(int), vec) << endl;
42
43 return 0;
44 }
1 #include <iostream>
2
3
4 #define INT_MAX 11
5 using namespace std;
6
7 int largetSubSequence(int arr[], int len) {
8 int *intmap = new int[INT_MAX];
9
10 for(int i = 0; i < len; i++) {
11 intmap[arr[i]] = 1;
12 }
13
14 int last = -1;
15 int count = 0;
16 int maxCount = 0;
17 for(int i = 0; i < INT_MAX; i++) {
18 if(last == -1) {
19 last = intmap[i];
20 count++;
21 } else {
22 if(intmap[i]==1) {
23 count++;
24 } else {
25 count = 0;
26 }
27 last = intmap[i];
28 }
29 if(count > maxCount)
30 maxCount = count;
31 }
32
33 delete intmap;
34 return maxCount;
35 }
36
37 int main() {
38 int arr[] = {1,6,10,4,7,9,5};
40
41 cout << largetSubSequence(arr, sizeof(arr)/sizeof(int)) << endl;
42
43 return 0;
44 }
1 #include <iostream>
2
3 using namespace std;
4
5 int main() {
6 int arr[] = {1,2,2,2,3,3,3,4,4,5,5,6};
7 int len = sizeof(arr)/sizeof(int);
8
9 int i, j = 0;
10 for(i = 1; i < len; i++) {
11 if(arr[i]==arr[j]) {
12 } else {
13 arr[++j] = arr[i];
14 }
15 }
16 for(int i = j+1; i < len; i++)
17 arr[i] = 0;
18
19 for(int i = 0; i < len; i++)
20 cout << arr[i] << " ";
21 cout << endl;
22
23 return 0;
24 }
1 #include <iostream>
2 #include <vector>
3 #include <algorithm>
4
5 using namespace std;
6
7 void addOne(int arr[], int len, vector<int>& vec) {
8 if(arr == 0 || len == 0) return;
9
10 int carry = 1;
11
12 for(int i = len-1; i >= 0; i--) {
13 arr[i] += carry;
14 carry = arr[i]/10;
15 arr[i] %= 10;
16 vec.push_back(arr[i]);
17 }
18 if(carry)
19 vec.push_back(carry);
20 }
21
22 int main() {
23 int arr[] = {9, 9};
24 int len = sizeof(arr)/sizeof(int);
25 vector<int> vec;
26 addOne(arr, len, vec);
27 reverse(vec.begin(), vec.end());
28 for(int i = 0; i < vec.size(); i++)
29 cout << vec[i] << " ";
30 cout << endl;
31
32 return 0;
33 }
1 #include <iostream>
2 #include <vector>
3 #include <algorithm>
4
5 using namespace std;
6
7 void addOne(int arr[], int len, vector<int>& vec) {
8 if(arr == 0 || len == 0) return;
9
10 int carry = 1;
11
12 for(int i = len-1; i >= 0; i--) {
13 arr[i] += carry;
14 carry = arr[i]/10;
15 arr[i] %= 10;
16 vec.push_back(arr[i]);
17 }
18 if(carry)
19 vec.push_back(carry);
20 }
21
22 int main() {
23 int arr[] = {9, 9};
24 int len = sizeof(arr)/sizeof(int);
25 vector<int> vec;
26 addOne(arr, len, vec);
27 reverse(vec.begin(), vec.end());
28 for(int i = 0; i < vec.size(); i++)
29 cout << vec[i] << " ";
30 cout << endl;
31
32 return 0;
33 }
1 #include <iostream>
2 #include <algorithm>
3
4 using namespace std;
5
6 bool comp(int a, int b) {
7 while(a>=10) a/=10;
8 while(b>=10) b/=10;
9 return (a>b);
10 }
11
12 void swap(int *a, int *b) {
13 int tmp = *a;
14 *a = *b;
15 *b = tmp;
16 }
17
18 void permutation(int arr[], int len, int *start, int *end) {
19 if(arr == 0) return;
20 if(start == end) {
21 for(int i = 0; i < len; i++)
22 cout << arr[i];
23 cout << endl;
24 return;
25 }
26
27 for(int *begin = start; begin < end ; begin++) {
28 swap(start, begin);
29 permutation(arr, len, start+1, arr+len);
30 swap(start, begin);
31 }
32 }
33
34 int main() {
35 int arr[] = {12,4,66,8,9};
36 // int arr[] = {1,2,3};
37 int len = sizeof(arr)/sizeof(int);
38 sort(arr, arr+len, comp);
39
40 permutation(arr, len, arr, arr+len);
41
42 return 0;
43 }
Repammiwilson5, Personnel at BMO Harris Bank
Hi I am Ammy from Served on a research team for improved customer satisfaction survey process,Moderated focus groups to ...
Repthubmorfin, Android Engineer at ABC TECH SUPPORT
I am currently working as a safety-focused Service Technician from Red Bank. I execute routine maintenance work while advising clients ...
RepAvikaEthan, Data Engineer at Adjetter Media Network Pvt Ltd.
Avika Ethan has five years of experience collecting physical and biological data in California streams and rivers. In the field ...
The two programs above both work well for the problem.
- cjmemory September 30, 2012