Skip to content

Files

Latest commit

e8eacc4 Β· Mar 26, 2021

History

History

swea1263

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Mar 26, 2021
Mar 26, 2021
Mar 26, 2021
Mar 26, 2021

[SW Expert Academy - 1263] μ‚¬λžŒ λ„€νŠΈμ›Œν¬2

image image image

ν”Œλ‘œμ΄λ“œ μ›Œμ…œμ—μ„œ if (i == j) continue ??

for (int k = 0; k < N; k++) {
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            // if (i == j || i == k) continue;
            D[i][j] = Math.min(D[i][j], D[i][k] + D[k][j]);
        }
    }
}

쑰건 처리의 둜직 λ•Œλ¬ΈμΈμ§€ μœ„μ˜ if (i == j || i == k) continue; 문을 λ„£κ³  μ•ˆ λ„£κ³ μ˜ μ‹œκ°„ 차이가 λ„ˆλ¬΄ 많이 λ‚œλ‹€. 사싀 생각해보면 ν•„μš” μ—†λŠ” 둜직이긴 ν•œλ°... κ·Έλž˜λ„ 항상 λ„£κ³  μ‹Άλ‹€λŠ” μƒκ°μ΄μ—ˆμ–΄....

  • static λ³€μˆ˜, 쑰건문 λ‹€ 뺐을 λ•Œ image
  • (포기할 수 μ—†λŠ”) (μ½”λ“œ 예쁜게 μ’‹μ•„) 첫번째 λ‚΄ μ½”λ“œ image