2018-04-04 20:36

Author: shiqitao

.gitignore

@@ -1,4 +1,5 @@
 NowCoder_C++/
 *.filters
 *.vcxproj
-Debug/
+Debug/
+test.cpp

腾讯2017暑期实习生编程题/01.cpp

@@ -0,0 +1,37 @@
+#include <iostream>
+#include <string>
+#include <cstring>
+#include <algorithm>
+using namespace std;
+int main()
+{
+	string str;
+	while (cin >> str) {
+		int len = str.size() + 1;
+		int **DP = new int*[len];
+		for (int i = 0; i < len; i++) {
+			DP[i] = new int[len];
+			memset(DP[i], 0, sizeof(int)*len);
+		}
+		for (int i = 1; i < len; i++) {
+			for (int j = i - 1; j >= 0; j--) {
+				DP[j][i] = max(DP[j][i - 1], 1);
+				for (int k = j; k < i - 1; k++) {
+					if (str[i - 1] == str[k]) {
+						DP[j][i] = max(DP[j][i], DP[k + 1][i - 1] + 2);
+						break;
+					}
+					else {
+						DP[j][i] = max(DP[j][i], DP[k + 1][i - 1]);
+					}
+				}
+			}
+		}
+		cout << len - 1 - DP[0][len - 1] << endl;
+		for (int i = 0; i < len; i++) {
+			delete[] DP[i];
+		}
+		delete[] DP;
+	}
+	return 0;
+}

腾讯2017暑期实习生编程题/02.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+using namespace std;
+int main()
+{
+	string str;
+	while (cin >> str) {
+		for (int k = 0; k < str.size(); k++) {
+			bool stop = true;
+			for (int i = str.size() - 1; i > 0; i--) {
+				if (str[i - 1] >= 'A'&&str[i - 1] <= 'Z' && (str[i]<'A' || str[i]>'Z')) {
+					swap(str[i - 1], str[i]);
+					stop = false;
+				}
+			}
+			if (stop) break;
+		}
+		cout << str << endl;
+	}
+	return 0;
+}

腾讯2017暑期实习生编程题/03.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <limits.h>
+#include <map>
+using namespace std;
+struct Num{ int num, count; };
+int main()
+{
+	int n, temp;
+	while (cin >> n) {
+		map<int, int> data;
+		for (int i = 0; i < n; i++) {
+			cin >> temp;
+			data[temp]++;
+		}
+		Num *num = new Num[data.size()];
+		int p = 0, numMin = 0;
+		for (map<int, int>::iterator it = data.begin(); it != data.end(); ++it, ++p) {
+			num[p].num = it->first;
+			num[p].count = it->second;
+			numMin += num[p].count*(num[p].count - 1) / 2;
+		}
+		if (numMin == 0) {
+			int minNum = INT_MAX;
+			for (int i = 0; i < p - 1; i++) {
+				if (num[i + 1].num - num[i].num < minNum) {
+					minNum = num[i + 1].num - num[i].num;
+					numMin = num[i + 1].count*num[i].count;
+				}
+				else if (num[i + 1].num - num[i].num == minNum) {
+					numMin += num[i + 1].count*num[i].count;
+				}
+			}
+		}
+		cout << numMin << " " << num[0].count*num[p - 1].count << endl;
+		delete[] num;
+	}
+	return 0;
+}