[Java] 蓝桥杯ALGO-139 算法训练 s01串

问题描述
s01串初始为”0″
按以下方式变换
0变1，1变01
输入格式
1个整数(0~19)
输出格式
n次变换后s01串
样例输入
3
样例输出
101
数据规模和约定
0~19

package algo139;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner inScanner = new Scanner(System.in);
        int n = inScanner.nextInt();
        inScanner.close();
    
        String string = new String("0");
        for (int i = 0; i < n; i++) {
            String tmp = "";
            for (int j = 0; j < string.length(); j++) {
                char c = string.charAt(j);
                if (c == '0') {
                    tmp += '1';
                } else {
                    tmp += "01";
                }
            }
            string = tmp;
        }
        
        System.out.println(string);
    }
}

package algo139;

import java.util.Scanner;

public class Main {

public static void main(String[] args) {

Scanner inScanner = new Scanner(System.in);

int n = inScanner.nextInt();

inScanner.close();

String string = new String("0");

for (int i = 0; i < n; i++) {

String tmp = "";

for (int j = 0; j < string.length(); j++) {

char c = string.charAt(j);

if (c == '0') {

tmp += '1';

} else {

tmp += "01";

}

string = tmp;

}

System.out.println(string);

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版