Study Anything ๐Ÿง

118. Pascal's Triangle ๋ณธ๋ฌธ

์•Œ๊ณ ๋ฆฌ์ฆ˜๋ฌธ์ œ ํ’€์ด/LeetCode

118. Pascal's Triangle

์†” 2022. 3. 8. 23:40

#Array #DynamicProgramming

 

์ค„ ์ˆ˜๊ฐ€ ์ฃผ์–ด์กŒ์„ ๋•Œ, ํŒŒ์Šค์นผ ์‚ผ๊ฐํ˜•์„ ๋ฐ˜ํ™˜ํ•˜๋ผ.

( * ํŒŒ์Šค์นผ ์‚ผ๊ฐํ˜•: ๊ฐ ์œ„์น˜์˜ ๊ฐ’์ด ๋ฐ”๋กœ ์œ„์˜ ๋‘ ๊ฐ’์˜ ํ•ฉ์œผ๋กœ ์ด๋ฃจ์–ด์ง„ ์‚ผ๊ฐํ˜• )


Trial 1 : Python3, 22/03/08

class Solution:
    def generate(self, numRows: int) -> List[List[int]]:
        re = [[1]]
        for r in range(1,numRows):
            re.append([1] * (r+1))
            for i in range(1,r):
                re[r][i] = re[r-1][i-1] + re[r-1][i]
        return re

 

๋ฆฌ๋ทฐ: 

๋Ÿฐํƒ€์ž„ 94.90%, ๋ฉ”๋ชจ๋ฆฌ 98.61% ์˜ ๊ฒฐ๊ณผ๋ฅผ ์–ป์—ˆ๋‹ค. ์ด๋ฒˆ์—” ๋ฌธ์ œ๊ฐ€ ์กฐ๊ธˆ ์‰ฝ๊ธด ํ–ˆ์ง€๋งŒ ์ €๋ฒˆ ๋ฌธ์ œ๋„ ๊ทธ๋ ‡๊ณ 

Dynamic Programming ์นดํ…Œ๊ณ ๋ฆฌ ํŠน์ง• ์ƒ ๋ฌธ์ œ๋ฅผ ์„ธ๋ถ„ํ™”ํ•ด์„œ ํ•ด๊ฒฐ ๋‹จ๊ณ„๋ฅผ ์„ธ์šฐ๊ณ  ์ „์ฒด ๋ฌธ์ œ๋ฅผ ํ’€์–ด๊ฐ€๋Š”๋ฐ,

ํ•˜๋‚˜์”ฉ ํ•ด๊ฒฐํ•˜๋‹ค๊ฐ€ ์ „์ฒด ํ’€์ด๊ฐ€ ์™„์„ฑ๋˜๋Š” ๊ฒƒ์ด ๋ฟŒ๋“ฏํ•จ์ด ํฐ ๊ฒƒ ๊ฐ™๋‹ค!

 

 

728x90
Comments