happy coding

[java] 10093. 숫자 본문

coding study/baekjoon

[java] 10093. 숫자

yeoonii 2023. 7. 28. 02:00
import java.io.*;
import java.lang.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        //두 수 a와 b를 입력 받음
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        long a = Long.parseLong(st.nextToken());
        long b = Long.parseLong(st.nextToken());

        long output1 = b-a-1;
        long[] output2 = new long[(int) output1];

        for (int i = (int) output1 - 1; i >= 0; i--) {
            output2[i] = b-i-1;
        }
        Arrays.sort(output2);
        System.out.println(output1);
        for (int i=0 ; i< output1 ; i++) {
            System.out.printf(output2[i] + " ");
        }
    }
}

이게 안되네

import java.io.*;
import java.lang.*;
import java.util.*;

public class Main {
    public static void main(String[] args) throws IOException {
        //두 수 a와 b를 입력 받음
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());

        long a = Long.parseLong(st.nextToken());
        long b = Long.parseLong(st.nextToken());

        if (a == b) {
            System.out.println(0);
        }
        if (a<b) {
            System.out.println(b-a-1);
            for (long i=a+1 ; i<b ; i++) {
                System.out.printf(i + " ");
            }
        }
        if (a>b) {
            System.out.println(a-b-1);
            for (long i=b+1 ; i<a ; i++) {
                System.out.printf(i + " ");
            }
        }
    }
}

코드를 좀 더 꼼꼼하게 작성하기로 마음먹음..반복문도 조심하자.

 

'coding study > baekjoon' 카테고리의 다른 글

[java] 2920.음계  (0) 2023.07.28
[java] 5585. 거스름돈  (0) 2023.07.28
[java] 10870. 피보나치 수 5  (0) 2023.07.28
[java] 10988. 팰린드롬인지 확인하기  (0) 2023.07.28
[java] 13235. 팰린드롬  (0) 2023.07.28
Comments