Skip to content

Instantly share code, notes, and snippets.

View qkreltms's full-sized avatar
๐Ÿ’–
Happy coding

JungHoonPark qkreltms

๐Ÿ’–
Happy coding
View GitHub Profile
L = int(input())
A = sorted(list(map(int, input().split())))
B = sorted(list(map(int, input().split())), reverse=True)
B = B[L-len(B):]
S = sum([A[i] * B[i] for i in range(L)])
print(S)
import re
def return_uppercase(str):
return "".join(re.compile('[A-Z]').findall(str)) # isUpper()์‚ฌ์šฉํ•˜๋ฉด ๋”
print(return_uppercase(input()))
@qkreltms
qkreltms / localstorage.html
Last active September 10, 2018 09:03
Simple javascript local storage usage example with JSON
<html>
</html>
<script>
let a = {
test1: 1,
test2: 2
}
localStorage.setItem('test', JSON.stringify(a))
let temp = JSON.parse(localStorage.getItem('test'))
@qkreltms
qkreltms / DFS_MapSearching.py
Last active July 22, 2018 11:28
๊นŠ์ด์šฐ์„ ํƒ์ƒ‰ ์ง€๋„ํƒ์ƒ‰ ์•Œ๊ณ ๋ฆฌ์ฆ˜
class DFS_MapSearching:
def __init__(self):
self.row, self.col = list(map(int, input("ํ–‰, ์—ด:").split()))
self._map = [[0] * self.row for _ in range(self.col)]
self._min = self.row * self.col
print("ํƒ์ƒ‰ํ•  ์ง€๋„:")
for i in range(self.col):
for j in range(self.row):
self._map[i][j] = 1
@qkreltms
qkreltms / K Closest Points to the Origin And Given Value.py
Last active July 6, 2018 08:48
์ฃผ์–ด์ง„ ๊ฐ’์—์„œ ๊ฐ€์žฅ ๊ฐ€๊นŒ์šด ๊ฑฐ๋ฆฌ๋ฅผ ๊ตฌํ•˜๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜
# ref: https://www.youtube.com/watch?v=eaYX0Ee0Kcg&t=0s&list=PLBZBJbE_rGRVnpitdvpdY9952IsKMDuev&index=5
# ์ด ๋ชจ๋“ˆ์˜ ๊ธฐ๋Šฅ
# 1. ์ฃผ์–ด์ง„ ์ขŒํ‘œ ๋ฐฐ์—ด์—์„œ 0, 0๊ณผ ๊ฐ€์žฅ ๊ฐ€๊นŒ์šด ๊ฐ’์„ ๊ตฌํ•œ๋‹ค.
# 2. ์ฃผ์–ด์ง„ ์ขŒํ‘œ ๋ฐฐ์—ด์—์„œ ์ฃผ์–ด์ง„ ์ขŒํ‘œ์™€ ๊ฐ€์žฅ ๊ฐ€๊นŒ์šด ๊ฐ’์„ ๊ตฌํ•œ๋‹ค.
# 3. ์ฃผ์–ด์ง„ ์ขŒํ‘œ ๋ฐฐ์—ด์—์„œ ์ฃผ์–ด์ง„ ์ขŒํ‘œ์™€ ๊ฐ€์žฅ ๊ฐ€๊นŒ์šด ๊ฐ’์˜ ๋ฐฐ์—ด์„ ๊ตฌํ•œ๋‹ค.
# functions of this module
# 1. get closest points from 0, 0 in given points array
# 2. get closest points from given value in given points array
# 3. get closest points array from given value in given points array
@qkreltms
qkreltms / var-let-const.md
Created July 1, 2018 13:52 — forked from LeoHeo/var-let-const.md
javascript var, let, const ์ฐจ์ด์ 

var, let, const ์ฐจ์ด์ ์€?

  • var๋Š” function-scoped์ด๊ณ , let, const๋Š” block-scoped์ž…๋‹ˆ๋‹ค.

  • function-scoped์™€ block-scoped๊ฐ€ ๋ฌด์Šจ๋ง์ด๋ƒ?

var(function-scoped)

jsfiddle ์ฐธ๊ณ ์ฃผ์†Œ

@qkreltms
qkreltms / 094607.md
Created July 1, 2018 13:51 — forked from marocchino/094607.md
ES6์‹œ๋Œ€์˜ JavaScript

ES6์‹œ๋Œ€์˜ JavaScript

์•ˆ๋…•ํ•˜์„ธ์š”. ์‚ฌ์›์‚ฌ์—…๋ถ€์˜ ๋งˆ๋ฃจ์•ผ๋งˆ@h13i32maru์ž…๋‹ˆ๋‹ค. ์ตœ๊ทผ์˜ Web ํ”„๋ก ํŠธ์—”๋“œ์˜ ๋ณ€ํ™”๋Š” ๋งค์šฐ ๊ฒฉ๋ ฌํ•ด์„œ, ์กฐ๊ธˆ ๋ˆˆ์„ ๋• ์‚ฌ์ด์— ์ ์  ์ƒˆ๋กœ์šด ๊ฒƒ์ด ๋‚˜์˜ค๊ณ  ์žˆ๋”๋ผ๊ตฌ์š”. ๊ทธ๋Ÿฐ ๊ฒฉ๋ ฌํ•œ ๋ณ€ํ™”์ค‘ ํ•˜๋‚˜๊ฐ€ ES6์ด๋ผ๋Š” ์ฐจ์„ธ๋Œ€ JavaScript์˜ ์‚ฌ์–‘์ž…๋‹ˆ๋‹ค. ์ด ES6๋Š” ํ˜„์žฌ ์žฌ์ •์ค‘์œผ๋กœ ์ง‘ํ•„์‹œ์ ์—์„œ๋Š” Draft Rev31์ด ๊ณต๊ฐœ๋˜์–ด์žˆ์Šต๋‹ˆ๋‹ค.

JavaScript๋Š” ECMAScript(ECMA262)๋ผ๋Š” ์‚ฌ์–‘์„ ๊ธฐ๋ฐ˜์œผ๋กœ ๊ตฌํ˜„๋˜์–ด์žˆ์Šต๋‹ˆ๋‹ค. ํ˜„์žฌ ๋ชจ๋˜ํ•œ Web ๋ธŒ๋ผ์šฐ์ €๋Š” ECMAScript 5.1th Edition์„ ๊ธฐ๋ฐ˜์œผ๋กœ ํ•œ JavaScript์‹คํ–‰ ์—”์ง„์„ ํƒ‘์žฌํ•˜๊ณ  ์žˆ์Šต๋‹ˆ๋‹ค. ๊ทธ๋ฆฌ๊ณ  ๋‹ค์Œ ๋ฒ„์ „์ธ ECMAScript 6th Edition์ด ํ˜„์žฌ ์žฌ์ •์ค‘์œผ๋กœ, ์•ฝ์นญ์œผ๋กœ ES6์ด๋ผ๋Š” ๋ช…์นญ์ด ์‚ฌ์šฉ๋˜๊ณ  ์žˆ์Šต๋‹ˆ๋‹ค.

@qkreltms
qkreltms / FindSmallistPositiveInteger.py
Last active June 3, 2018 00:25
์ •์ˆ˜ ๋ฐฐ์—ด์ด ์ฃผ์–ด์งˆ ๋•Œ 0๋ณด๋‹ค ํฌ๊ณ  ๋ฐฐ์—ด์— ์—†๋Š” ๊ฐ€์žฅ ์ž‘์€ ์–‘์˜ ์ •์ˆ˜ ์ฐพ๊ธฐ
def solution(arr):
# ์Œ์ˆ˜๋Š” ์ œ์™ธ(์—†์–ด๋„ ์ƒ๊ด€์—†์Œ)
arr = list(filter(lambda item: item > 0, arr))
# start๋ฅผ 1๋ถ€ํ„ฐ n๊นŒ์ง€ +1์”ฉ ํ•˜๋ฉด์„œ ๋ฐฐ์—ด์— ์—†์œผ๋ฉด start๋ฐ˜ํ™˜
start = 1
while True:
if start not in arr:
return start
start += 1
@qkreltms
qkreltms / gist:af6c20abd255a432113c1736083632da
Created May 2, 2018 13:24
์ •๋ ฌ ํ•จ์ˆ˜ ์‚ฌ์ดํŠธ
https://github.com/minsuk-heo/problemsolving/blob/master/sort/InsertionSort.py
'''
ํ‘ธ๋Š”๋ฐฉ๋ฒ•
1)1๋กœ ์‹œ์ž‘ํ•œ๋‹ค
2)1์ด ๋‘ ๋ฒˆ์—ฐ์† ๋‚˜ํƒ€๋‚˜์ง€ ์•Š๋Š”๋‹ค. ์˜ˆ 1100(x)
1
10
100
101
1000