GiantStepDEV

1번

    *
   **
  ***
 ****
*****
package 백준2439번문제;
import java.util.Scanner;

public class BaekJonn2439 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for(int i = 0; i < n; i++) {
            for(int j = 0; j < n; j++) {
                if(j == n-1 || j >= (n-i)-1) System.out.print("*");
                else System.out.print(" ");
            }
            System.out.println();
        }
    }
}

2번

*
**
***
****
*****
package 백준2439번문제;
import java.util.Scanner;

public class BaekJonn2439 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for(int i = 1; i <= n; i++){
            for(int j = 0; j < i ; j++) {
                System.out.print("*");
            }
            System.out.println();
        }
    }
}

3번

*******
******
*****
****
***
**
*
package 백준2439번문제;
import java.util.Scanner;

public class BaekJonn2439 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        for(int i = n; i > 0; i--) {
            for(int j = 0; j < i; j++) {
                System.out.print("*");
            }
            System.out.println();
        }
    }
}
profile

GiantStepDEV

@kongmi

포스팅이 좋았다면 "좋아요❤️" 또는 "구독👍🏻" 해주세요!