PAT 乙级-1005

 方法一：(注意map使用时的坑)

#include<iostream>
#include<map>
#include<algorithm>
using namespace std;

int main() {
	int n, tmp, num[100];
	map<int, char> mp;
	cin >> n;
	for(int i = 0; i < n; i++) {
		cin >> num[i];
		tmp = num[i];
		while(tmp != 1) {
			if(tmp % 2) tmp = (tmp * 3 + 1) / 2;
			else tmp /= 2;
			mp[tmp] = 'f';
		}
	}
	sort(num, num + n);
	tmp = 0;
	for(int i = n - 1; i >= 0; i--) {
		if(mp[num[i]] != 'f') {
			if(tmp++) cout << " ";
			cout << num[i];
		}
	}
	return 0;
}

看以下代码：

#include<iostream>
#include<map>
using namespace std;
int main() {
	map<int, bool> mp;	
	mp[12] = true;
	cout << mp[2]; 
// ===============	mp.size() 输出结果为 2   ===============
	cout << mp.size();  
}

使用数组时，记得给变量，数组赋“初始值”，以免踩bug，  如下(见注释说明)

#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
bool cmp(int a, int b) { return a > b; }
int main() {
	int n, k, hash[10000] = {0}, flag = 0;   // 不给hash数组赋初始值0可能会导致bug，
// 若改成 int n, k , hash[100], flag = 0; 最后两个测试点报错
	cin >> n;
	vector<int> num(n);
	for(int i = 0; i < n; i++) {
		cin >> k;
		num[i] = k;
		while(k!=1) {
			if(k%2) k = (k * 3 + 1) / 2;
			else k /= 2;
			if(hash[k] == 1) break;
			hash[k] = 1;
		}
	}
	sort(num.begin(), num.end(), cmp);	
	for(int i = 0;i<n;i++) {
		if(hash[num[i]] == 0) {
			if(flag) cout << " ";
			cout << num[i];
			flag = 1;
		}
	}
	return 0;
}

方法二：(来自柳神)

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int arr[10000];
bool cmp(int a, int b) {return a > b;}
int main() {
    int k, n, flag = 0;
    cin >> k;
    vector<int> v(k);
    for (int i = 0; i < k; i++) {
        cin >> n;
        v[i] = n;
        while (n != 1) {
            if (n % 2 != 0) n = 3 * n + 1;
            n = n / 2;
            if (arr[n] == 1) break;
            arr[n] = 1;
        }
    }
    sort(v.begin(), v.end(), cmp);
    for (int i = 0; i < v.size(); i++) {
        if (arr[v[i]] == 0) {
            if (flag == 1) cout << " ";
            cout << v[i];
            flag = 1;
        }
    }
    return 0;
}