版权声明:我的GitHub:https://github.com/617076674。真诚求星! https://blog.csdn.net/qq_41231926/article/details/83213358
我的PAT-BASIC代码仓:https://github.com/617076674/PAT-BASIC
原题链接:https://pintia.cn/problem-sets/994805260223102976/problems/994805318855278592
题目描述:
知识点:字符串
思路:用一个数组来存储1、2、3、4、5、6、7、8、9对应的字符串
题给的正整数不超过3位,因此时间复杂度和空间复杂度分析没有必要。
C++代码:
#include<iostream>
#include<vector>
#include<string>
using namespace std;
int main() {
int num;
cin >> num;
vector<int> nums;
while (num > 0) {
nums.push_back(num % 10);
num /= 10;
}
string result;
string strings[] = { "1", "12", "123", "1234", "12345", "123456", "1234567", "12345678", "123456789" };
if (nums.size() == 3) {
while (nums[2] > 0) {
nums[2]--;
result += "B";
}
while (nums[1] > 0) {
nums[1]--;
result += "S";
}
if (nums[0] != 0) {
result += strings[nums[0] - 1];
}
} else if (nums.size() == 2) {
while (nums[1] > 0) {
nums[1]--;
result += "S";
}
if (nums[0] != 0) {
result += strings[nums[0] - 1];
}
} else {
if (nums[0] != 0) {
result += strings[nums[0] - 1];
}
}
cout << result;
}
C++解题报告:
JAVA代码:
import java.util.ArrayList;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
String[] strings = {"1", "12", "123", "1234", "12345", "123456", "1234567", "12345678", "123456789"};
Scanner scanner = new Scanner(System.in);
int num = scanner.nextInt();
ArrayList<Integer> arrayList = new ArrayList<>();
while(num > 0){
arrayList.add(num % 10);
num /= 10;
}
StringBuilder stringBuilder = new StringBuilder();
if(arrayList.size() == 3){
for (int i = 0; i < arrayList.get(2); i++) {
stringBuilder.append("B");
}
for (int i = 0; i < arrayList.get(1); i++) {
stringBuilder.append("S");
}
if(arrayList.get(0) != 0) {
stringBuilder.append(strings[arrayList.get(0) - 1]);
}
}else if(arrayList.size() == 2){
for (int i = 0; i < arrayList.get(1); i++) {
stringBuilder.append("S");
}
if(arrayList.get(0) != 0) {
stringBuilder.append(strings[arrayList.get(0) - 1]);
}
}else{
if(arrayList.get(0) != 0) {
stringBuilder.append(strings[arrayList.get(0) - 1]);
}
}
System.out.println(stringBuilder.toString());
}
}
JAVA解题报告: