์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | |||
5 | 6 | 7 | 8 | 9 | 10 | 11 |
12 | 13 | 14 | 15 | 16 | 17 | 18 |
19 | 20 | 21 | 22 | 23 | 24 | 25 |
26 | 27 | 28 | 29 | 30 | 31 |
- MySQL
- ํด์
- ๋ ์์ ํฉ
- ํ์ด์ฌ
- ์ํด๋ฆฌ ์ฑ๋ฆฐ์ง
- JSP
- JavaScript
- ๋ฐฐ์ด
- ์คํ๋ง
- ์๋ฐ
- Lambda
- ์ฅ๊ณ
- Servlet
- ๋ฐฑ์ค c++
- ๋ฐฑ์ค
- ๊ฐ๋ฆ
- ํฌ ํฌ์ธํฐ
- ํ
- 1๋จ๊ณ
- Set
- Deque
- ์คํ
- jquery
- ์ฝ๋์
- counter
- R
- ํ๋ก๊ทธ๋๋จธ์ค
- ์ฝ๋ฉํ ์คํธ
- hash
- 2๋จ๊ณ
- Today
- Total
๋ชฉ๋ก์ํด๋ฆฌ ์ฑ๋ฆฐ์ง (2)
Development
๋ด ์ฝ๋ def solution(weights, head2head): answer = [] for i in range(len(weights)): win=win_count=game=0 for j,h in enumerate(head2head[i]): if h=="W": win+=1 win_count+= 1 if weights[i] < weights[j] else 0 game+=1 if h!="N" else 0 win = win/game if game!=0 else 0 answer.append([i+1,win,win_count,weights[i]]) return [i[0] for i in sorted(answer,key=lambda x:(-x[1],-x[2],-x[3],x[0]))] answer list์ ์..
ํ๋ก๊ทธ๋๋จธ์ค์ ์ํด๋ฆฌ ์ฑ๋ฆฐ์ง๋ผ๋๊ฒ ์๊ฒผ๋ค!! ๋งค์ฃผ ๋ฌธ์ ๊ฐ ๋์ค๋๋ฐ.. ๊ฐ์ฅ ์ข์์ ๋ง์ด ๋ฐ๋์ฌ๋ํํ ์ํ๊ถ์ ์ค๋ค๊ณ ์ ํ์๋ค ใ ์ฉ.. ๊ทผ๋ฐ ๋ค ํ๊ณ ๋ค์ด๊ฐ๋ณด๋๊น ์ด๋ฏธ ๋๋ณด๋ค ๋ ์ํผ์ฌ๋๋ค์ด ๋ง๋๋ผ^^.... ์์ฝ.. ๋นจ๋ฆฌ ํ์ด์ผ ์ข์์๋ ๋ง์ด ๋ฐ์๊บผ๊ฐ์๋ฐ ์ด๋ฏธ 800๋ช ์ด๋ ํ์์๋ค.. ์๋ ์ค๋๋ถํฐ ์ฑ๋ฆฐ์ง ์์์ธ๋ฐ ์ฌ๋๋ค ์ง์ง ๋น ๋ฅด๋ค ใ 1์ฃผ์ฐจ๋ผ์ ๊ทธ๋ฐ์ง ๋ฌธ์ ๋ ์ด๋ ต์ง์๋ค! 2์ฃผ์ฐจ๋ 1๋จ๊ณ์์ผ๋ฉด ์ข๊ฒ ๋ค^^ 2๋จ๊ณ๋ ๋ฌด๋ฆฌ์ผ^^.. ๋ด ์ฝ๋ def solution(price, money, count): answer = sum([price*(i+1) for i in range(count)]) - money return answer if answer > 0 else 0 ๋์ด๊ธฐ๊ตฌ ๊ฐ๊ฒฉ ๋ฆฌ์คํธ๋ฅผ ๋ง๋ค์ด์คํ sum..