algorithm & data structure

[๋ชจ๋‘์˜ ์•Œ๊ณ ๋ฆฌ์ฆ˜] ์ตœ๋Œ“๊ฐ’ ์ฐพ๊ธฐ

์ฐธ๊ณ  ๊ต์žฌ: ๋ชจ๋‘์˜ ์•Œ๊ณ ๋ฆฌ์ฆ˜ with ํŒŒ์ด์ฌ

โ“ ๋ฌธ์ œ

์ฃผ์–ด์ง„ ์ˆซ์ž n๊ฐœ ์ค‘ ๊ฐ€์žฅ ํฐ ์ˆซ์ž๋ฅผ ์ฐพ๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜

์ž…๋ ฅ: 17, 92, 18, 33, 58, 7, 33, 42
์ถœ๋ ฅ: 92

 

โ—๏ธ ํ’€์ด

python

def find_max(numList):
    max = numList[0]
    for i in range(0, len(numList)):
        if max < numList[i]:
            max = numList[i]
    return max
 
print(find_max([1, 23, 29, 12, 39, 7, 15]))

Swift5

public func find_max(list: [Int]) -> Int {
    var max = list[0]
    for i in list {
        if max < i {
            max = i
        }
    }
    return max
}

 

๋ฐ˜์‘ํ˜•