Finish the Algorithm part #4

Original file line number	Diff line number	Diff line change
		@@ -1,29 +1,49 @@
	#include <cstring>
	#include <cstdlib>
	#include <string>
		#include <iostream>
	#include <vector>
	#include <algorithm>
		using namespace std;

		// �ڴ˴��Ĵ��
	struct CMy_add
	int CompareString(const void * e1, const void * e2)
		{
	int ∑
	CMy_add(int &s) :sum(s) {}
	void operator()(int val)
	{
	sum += (val & 7);
	}
	};

	int main(int argc, char* argv[])
	MyString * s1 = (MyString *)e1;
	MyString * s2 = (MyString *)e2;
	if (s1 < s2)
	return -1;
	else if (s1 == s2)
	return 0;
	else if (s1 > s2)
	return 1;
	}
	int main()
		{
	int v, my_sum = 0;
	vector<int> vec;
	cin >> v;
	while (v) {
	vec.push_back(v);
	cin >> v;
	}
	for_each(vec.begin(), vec.end(), CMy_add(my_sum));
	cout << my_sum << endl;
	MyString s1("abcd-"), s2, s3("efgh-"), s4(s1);
	MyString SArray[4] = { "big","me","about","take" };
	cout << "1. " << s1 << s2 << s3 << s4 << endl;
	s4 = s3;
	s3 = s1 + s3;
	cout << "2. " << s1 << endl;
	cout << "3. " << s2 << endl;
	cout << "4. " << s3 << endl;
	cout << "5. " << s4 << endl;
	cout << "6. " << s1[2] << endl;
	s2 = s1;
	s1 = "ijkl-";
	s1[2] = 'A';
	cout << "7. " << s2 << endl;
	cout << "8. " << s1 << endl;
	s1 += "mnop";
	cout << "9. " << s1 << endl;
	s4 = "qrst-" + s2;
	cout << "10. " << s4 << endl;
	s1 = s2 + s4 + " uvw " + "xyz";
	cout << "11. " << s1 << endl;
	qsort(SArray, 4, sizeof(MyString), CompareString);
	for (int i = 0; i < 4; i++)
	cout << SArray[i] << endl;
	//s1�Ĵ��±�0��ʼ��Ϊ4��Ӵ�
	cout << s1(0, 4) << endl;
	//s1�Ĵ��±�5��ʼ��Ϊ10��Ӵ�
	cout << s1(5, 10) << endl;
		return 0;
		}

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Finish the Algorithm part #4

Are you sure you want to change the base?

Uh oh!

Finish the Algorithm part #4

Filter by extension

Uh oh!

Uh oh!

Diff view

Diff view

There are no files selected for viewing

Uh oh!