PAT/C++甲级题解——字符串操作

第一章：字符串处理

​ 1152、1140、1136、1112、1108

①常用头文件

#include <iostream>

#include <cstring>

#include <map> 二维数组

#include <set> 非重复

using namespace std;

②常用函数

1. substr(starting_position, length)

   用于字符串操作中产生子串

   starting_position：主串中开始产生子串的位置

   length: 从开始位置往后取子串的长度

• 举例：

  std::string str0 =  "We think in generation";
  std::string str1 =  str0.substr(3, 5);
  cout >> str1;
  

  输出结果为: think

2. stoi(string_object) stod(string_object)

   用于字符串转int类型 用于字符串转double类型

   string_object：需要转换的字符串对象

• 举例：

  string str = "1234";
  int num = stoi(str);
  cout << num;
  

  输出结果为：1234 （int类型）

3. sscanf 和 sprintf 的妙用【判别格式是否合法】

   double temp;
   char a[50] b[50];
   cin >> n;
   for(int i = 0; i < n; i++){
       scanf("%s", a); // 读取字符串存入数组a
       sscanf(a, "%lf", &temp); //从数组a中按"%lf" 格式输出赋值给temp
       sprintf(b, "%.2f", temp); // 从temp中按"%.2f"(保留两位小数)的格式输入数组b
   }
   

③常用方法

1. 判断是否为素数:

   bool isPrime(int n){
       // 输入为0和1及负数的情况
       if(n <= 1) return false;
       // 排除0和1的情况后，从i=2开始遍历所有可能性到i*i
       for(int i = 2; i*i <= n; i++)
           if(n%i == 0) return false;
       return true;
   }
   

2. int类型转string

   int i;
   to_string(i);
   

3. 字符串与其倒置做加法

   string add(string s1, string s2) {
       string s = s1;
    	int carry = 0;
    	for (int i = s1.size() - 1; i >= 0; i--) {
    		s[i] = (s1[i] - '0' + s2[i] - '0' + carry) % 10 + '0';
    		carry = (s1[i] - '0' + s2[i] - '0' + carry) / 10;
    }
    	if (carry > 0) s = "1" + s;
    	return s; 
   }
   

④相应习题

#include <iostream>
#include <string>
using namespace std;

// 1152题--------------------------------------------------------
bool isPrime(int n){
	if(n == 0 || n == 1 ) return false;
	for(int i = 2 ; i*i <= n; i++)  
		if(n%i == 0) return false;
	return true;
} 

int main(){
	int l, k;
	string s;
	cin >> l >> k >> str;
	for(int j=0; j <= l-k; j++){
		string sub = str.substr(j, k);
		int n = stoi(sub);
		if(isPrime(n)){
			//测试时出现部分答案错误可能是答案输出的格式不正确 
			cout << sub;
			return 0;
		}
	}
	cout << "404";
	return 0;
}

// 1140题  注意清晰理解题目意思-------------------------------------
#include <bits/stdc++.h>
using namespace std;

string s;
int n, m, k;

int main(){
    // scanf("%s %d", &s, &m);
    cin >> s >> n;
    int j;
    for(int a = 1; a < n; a++){
        string tmp;
        for(int i = 0 ; i < s.length(); i = j){
            for(j = i; j < s.length(); j++)
                if(s[i] != s[j]) break;
            
            tmp += s[i] + to_string(j - i);
        }
        s = tmp;
    }
    cout << s;
    return 0;
}

//1136 简单题，注意细节→前置判断和结束return 0;-----------------------
// 加法通过类型转换为int型也可以做
// 但在一个循环内过多进行类型转换会导致大规模时出现边界溢出和运行问题
#include <iostream>
#include <algorithm>
using namespace std;

string rev(string t){
	reverse(t.begin(), t.end());
	return t;
}

//重点掌握 字符串与其倒置的加法
string add(string s1, string s2) {
    string s = s1;
 	int carry = 0;
 	for (int i = s1.size() - 1; i >= 0; i--) {
 		s[i] = (s1[i] - '0' + s2[i] - '0' + carry) % 10 + '0';
 		carry = (s1[i] - '0' + s2[i] - '0' + carry) / 10;
 }
 	if (carry > 0) s = "1" + s;
 	return s; 
}

int main(){
	int count = 10; 
	string s, sum;
	cin >> s;
	if(s == rev(s)){
		cout << s << " is a palindromic number.";
        return 0;
	}
	while(count--){
		sum = add(s, rev(s));
		cout << s << " + " << rev(s) << " = " << sum << endl;
		if(sum == rev(sum)){
			cout << sum << " is a palindromic number.";
			return 0;
		}
		s = sum;
	}
	cout << "Not found in 10 iterations.";
    return 0;
}
//1112 【推荐答案用map和set处理】题目理解有偏差------------------------
//通过字符串处理 16分
#include <iostream> 
using namespace std;

int main(){
	int k, j, len;
	string s, target, new_s;
	cin >> k >> s;
	for(int i = 0 ; i < s.length(); i=j){
		// if not broken continue next one
		if(s[i] != s[i+1]){
			new_s += s[i];
			j = i + 1;
			continue;
		}
		// if broken
		for(j = i ; j < s.length() && s[j] == s[i]; j++);
		len = j - i;
		
		if(len >= k){
			if(s[i] == 's'){
				for(int a = 0; a < len; a++){
					new_s += s[i];
				}
				continue;
			}
			if(target.find(s[i]) == string::npos){
				target += s[i];
			}
			for(int b = 0; b < len/k; b++)
				new_s += s[i];
		}else{
			if(target.find(s[i]) != string::npos){
				new_s += s[i];
				continue;
			}
			for(int c = 0; c < len; c++)
				new_s += s[i];
		}
	}
	cout << target << endl;
	cout << new_s ;
	return 0;
}
// 通过map和set处理
#include <iostream>
#include <map>
#include <set>
using namespace std;
//自动创建布尔型数组初始化为false
bool sureNoBroken[256];

int main() {
 	int k, cnt = 1;
 	scanf("%d", &k);
	string s;
 	cin >> s;
 	map<char, bool> m;
 	set<char> printed;
 	char pre = '#';
 	s = s + '#';
 	for(int i = 0; i < s.length(); i++) {
 		if(s[i] == pre) {
 			cnt++;
 		} else {
 			if(cnt % k != 0) {
 				sureNoBroken[pre] = true;
 			}
 			cnt = 1;
 		}
 		if(i != s.length() - 1) m[s[i]] = (cnt % k == 0);
 		pre = s[i];
 	}
 	for(int i = 0; i < s.length() - 1; i++) {
 		if(sureNoBroken[s[i]] == true)
 		m[s[i]] = false;
 	}
 	for(int i = 0; i < s.length() - 1; i++) {
 		if(m[s[i]] && printed.find(s[i]) == printed.end()) {
 			printf("%c", s[i]);
 			printed.insert(s[i]);
 		}
 	}
 	printf("\n");
 	for(int i = 0; i < s.length() - 1; i++) {
 		printf("%c", s[i]);
 		if(m[s[i]])
 			i = i + k - 1;
 	}
 	return 0; 
}
//1108 利用sscanf和sprintf对单个字符串进行格式化输入输出
// char a[50] 字符串数组可以通过strlen(a)等同于a.length()的效果
#include <iostream>
#include <cstring>
using namespace std;

int main() {
	int n, cnt = 0;
	char a[50], b[50];
	double temp, sum = 0.0;
	cin >> n ;
	for (int i = 0; i < n; i++){
		scanf("%s", a);
		sscanf(a, "%lf", &temp);
		sprintf(b, "%.2f", temp);
		int flag = 0;
		for(int j = 0; j < strlen(a); j++)
			if(a[j] != b[j]) flag = 1;
		if(flag || temp < -1000 || temp > 1000){
			printf("ERROR: %s is not a legal number\n", a);
			continue;
		}else{
			sum += temp;
			cnt++;
		}
	}
	if(cnt == 1)
		printf("The average of 1 number is %.2f", sum);
		
	else if(cnt > 1)
		printf("The average of %d numbers is %.2f", cnt, sum / cnt);
	else
		printf("The average of 0 numbers is Undefined");
 	return 0;
}