Algorithm

[ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค] [Level 1] ์ง์‚ฌ๊ฐํ˜• ๋ณ„์ฐ๊ธฐ

seulye 2022. 4. 8. 16:47
๋ฌธ์ œ ์„ค๋ช…

์ด ๋ฌธ์ œ์—๋Š” ํ‘œ์ค€ ์ž…๋ ฅ์œผ๋กœ ๋‘ ๊ฐœ์˜ ์ •์ˆ˜ n๊ณผ m์ด ์ฃผ์–ด์ง‘๋‹ˆ๋‹ค.
๋ณ„(*) ๋ฌธ์ž๋ฅผ ์ด์šฉํ•ด ๊ฐ€๋กœ์˜ ๊ธธ์ด๊ฐ€ n, ์„ธ๋กœ์˜ ๊ธธ์ด๊ฐ€ m์ธ ์ง์‚ฌ๊ฐํ˜• ํ˜•ํƒœ๋ฅผ ์ถœ๋ ฅํ•ด๋ณด์„ธ์š”.

 

ํ’€์ด
import java.util.Scanner;

class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int a = sc.nextInt();
        int b = sc.nextInt();

        for (int i=0; i<b; i++){
            for (int j=0; j<a; j++){
                System.out.print("*");
            }
            System.out.print("\n");
        }
    }
}

 

์ฐธ๊ณ 

1. Scanner ํด๋ž˜์Šค

- ์ฝ์€ ๋ฐ”์ดํŠธ๋ฅผ ๋ฌธ์ž, ์ •์ˆ˜, ์‹ค์ˆ˜, ๋ถˆ๋ฆฐ, ๋ฌธ์ž์—ด ๋“ฑ ๋‹ค์–‘ํ•œ ํƒ€์ž…์œผ๋กœ ๋ณ€ํ™˜ํ•˜์—ฌ ๋ฆฌํ„ดํ•˜๋Š” ํด๋ž˜์Šค

- Scanner๋Š” ์ž…๋ ฅ๋˜๋Š” ํ‚ค ๊ฐ’์„ ๊ณต๋ฐฑ์œผ๋กœ ๊ตฌ๋ถ„๋˜๋Š” ํ† ํฐ ๋‹จ์œ„๋กœ ์ฝ๋Š”๋‹ค.

(https://mine-it-record.tistory.com/103)

import java.util.Scanner;
Scanner sc = new Scanner(System.in);
int a = sc.nextInt(); // int
double a = sc.nextDouble(); // double
boolean a = sc.nextBoolean(); // boolean

 

2. void

๋‹ค๋ฅธ ์ฝ”๋”ฉ๋ฌธ์ œ๋“ค์€ ํŠน์ • ํƒ€์ž…์— ๋Œ€ํ•œ ๊ฐ’์„ return์„ ํ•ด์•ผํ•˜๋Š” ๊ฒฝ์šฐ๊ฐ€ ์žˆ์ง€๋งŒ,

์ด ๋ฌธ์ œ๋Š” main์ด void๋กœ ์„ ์–ธ ๋˜์–ด ์žˆ๊ธฐ๋•Œ๋ฌธ์— ์•„๋ฌด๊ฒƒ๋„ returnํ•˜์ง€ ์•Š์•„์•ผ ํ•œ๋‹ค. 

 

3. static

static๋กœ ์ƒ์„ฑ๋œ ๋ฉค๋ฒ„๋“ค์€ heap์˜์—ญ ๋Œ€์‹  static ์˜์—ญ์— ํ• ๋‹น์ด ๋œ๋‹ค. static ์˜์—ญ์— ํ• ๋‹น๋˜๋ฉด ๋ชจ๋“  ๊ฐ์ฒด๊ฐ€ ๊ณต์œ ํ•˜์—ฌ ์–ด๋””์„œ๋“ ์ง€ ์ฐธ์กฐํ•  ์ˆ˜ ์žˆ๋Š” ์žฅ์ ์„ ๊ฐ€์ง€์ง€๋งŒ, ํ”„๋กœ๊ทธ๋žจ ์ข…๋ฃŒ์‹œ๊นŒ์ง€ ๋ฉ”๋ชจ๋ฆฌ๊ฐ€ ํ• ๋‹น๋œ ์ฑ„๋กœ ์กด์žฌํ•˜๊ธฐ ๋•Œ๋ฌธ์— ๋„ˆ๋ฌด ๋‚จ๋ฐœํ•˜๋ฉด ์„ฑ๋Šฅ์— ์•…์˜ํ–ฅ์„ ์ค€๋‹ค. (https://coding-factory.tistory.com/524)