๋ฌธ์ : ์ฝ๋: -- ์ฝ๋๋ฅผ ์ ๋ ฅํ์ธ์ SELECT ANIMAL_ID, NAME, CASE WHEN SEX_UPON_INTAKE LIKE '%Neutered%' OR SEX_UPON_INTAKE LIKE '%Spayed%' THEN 'O' ELSE 'X' END AS '์ค์ฑํ' FROM ANIMAL_INS ORDER BY ANIMAL_ID ํ์ด: CASE WHEN์ ์ฌ์ฉํ๋ฉด ๋๋ค. CASE WHEN ์กฐ๊ฑด THEN '๋ฐํ ๊ฐ' WHEN ์กฐ๊ฑด THEN '๋ฐํ ๊ฐ' ELSE 'WHEN ์กฐ๊ฑด์ ํด๋น ์๋๋ ๊ฒฝ์ฐ ๋ฐํ ๊ฐ' END SELECT ์ค๊ฐ์ ์ฌ์ฉ!
๋ฌธ์ : ์ฝ๋: SELECT ANIMAL_ID, NAME FROM ANIMAL_INS WHERE ANIMAL_TYPE ='DOG'AND NAME LIKE '%EL%' ORDER BY NAME ํ์ด: WHERE NAME = 'EL' ํ๋ฉด ???๊ฐ ์ด๋ฆ์ด ์ปฌ๋ผ๋ง ๋์จ๋ค. 'EL'์ด ํฌํจ๋์ด ์๋ ์ด๋ฆ์ ๊ฒ์ํ๋ ค๋ฉด LIKE๋ฅผ ์จ์ผ๋๋ค. NAME LIKE 'EL%' -> EL๋ก ์์ํ๋ ์ด๋ฆ ์ถ๋ ฅ NAME LIKE '%EL' -> EL๋ก ๋๋๋ ์ด๋ฆ ์ถ๋ ฅ NAME LIKE '%EL%' -> EL์ด ํฌํจ๋์ด ์๋ ์ด๋ฆ ์ถ๋ ฅ
๋ฌธ์ : ์ฝ๋: SELECT HOUR(DATETIME) AS HOUR, COUNT(*) AS COUNT FROM ANIMAL_OUTS WHERE HOUR(DATETIME) BETWEEN 9 AND 19 GROUP BY HOUR(DATETIME) ORDER BY HOUR(DATETIME) ASC ํ์ด: 1. DATETIME์ "2014-06-28 13:40:00" ์ด๋ฐ ํ์์ผ๋ก ๋์ด ์์. -> HOUR ํจ์๋ฅผ ์ฌ์ฉํ๋ฉด ๋จ. 2. WHERE ๋ก ๋ฒ์ ์ง์ -> BETWEEN ? AND ? ํ๋ฉด ๋จ. / where๊น์ง๋ as hour์ด ์ ์ฉ ์๋จ! 3. GROUP BY, ORDER BY ๋ as hour ์ ์ฉ๋จ.
๋ฌธ์ : ์ฝ๋ : import sys from collections import deque # ๋ฐฉ๋ฌธ : 1 & ๋ฐฉ๋ฌธx : 0 def DFS(V): visited_dfs[V] = 1 print(V, end= ' ') for i in range(1, N+1): if visited_dfs[i] == 0 and graph[V][i]==1: DFS(i) def BFS(V): queue = deque([V]) visited_bfs[V] = 1 while queue: V = queue.popleft() print(V, end= ' ') for i in range(1, N+1): if visited_bfs[i] == 0 and graph[V][i] == 1: queue.append(i) visited_bfs[i] = 1..
Phillip Isola 1. Introduction Image-to-Image Translation์ ์ด๋ฏธ์ง๋ฅผ ์ ๋ ฅ์ผ๋ก ๋ฐ์์ ๋ ๋ค๋ฅธ ์ด๋ฏธ์ง๋ฅผ ์ถ๋ ฅ์ผ๋ก ๋ฐํํ๋ Task๋ฅผ ๋ปํ๋ค. ๋ณธ ๋ ผ๋ฌธ์ Image-to-Image Translation์ ์ ํฉํ cGAN์ ๊ธฐ๋ฐ์ผ๋กํ๋ฉฐ ๋ค์ํ Task์์ ์ข์ ๊ฒฐ๊ณผ๋ฅผ ๋ณด์ด๋ ํ๋ ์์ํฌ pix2pix๋ฅผ ๋ค๋ฃฌ๋ค. ์๋ ์ธ์ด ๋ฒ์ญ์ด ๊ฐ๋ฅํ ๊ฒ์ฒ๋ผ ์๋ image-to-image ๋ณํ ๋ํ ์ถฉ๋ถํ ํ์ต ๋ฐ์ดํฐ๊ฐ ์ฃผ์ด์ง๋ค๋ฉด ํ ์ฅ๋ฉด์ ํํ์ ๋ค๋ฅธ ์ฅ๋ฉด์ผ๋ก ๋ณํํ๋ ์์ ์ผ๋ก ์ ์ํ ์ ์๋ค. DCGAN๊ณผ ๋ค๋ฅธ์ ์ Generator(G)์ input์ด random vector๊ฐ ์๋๋ผ condition input ๋ผ๋ ์ ์ด๋ค. ๋ณธ ๋ ผ๋ฌธ์์ ์ฐ๋ฆฌ์ ๋ชฉํ๋ ์ด๋ฌํ ๋ชจ๋ ๋ฌธ์ ์ ๋ํ..
๋ฌธ์ ์ฝ๋: def solution(answers): cnt = [] cnt1 = 0 cnt2=0 cnt3=0 tmp = [] arr1 = [1,2,3,4,5] arr2 = [2,1,2,3,2,4,2,5] arr3 = [3,3,1,1,2,2,4,4,5,5] for i in range(len(answers)): if answers[i] == arr1[i%5]: cnt1 += 1 if answers[i] == arr2[i%8]: cnt2 += 1 if answers[i] == arr3[i%10]: cnt3 += 1 cnt.append(cnt1), cnt.append(cnt2), cnt.append(cnt3) c = max(cnt) m = cnt.index(c) + 1 for j in range(len(cnt..
์ฝ๋: def solution(progresses, speeds): answer = [] time = 0 count = 0 while len(progresses) > 0: if (progresses[0] + time*speeds[0]) >= 100: progresses.pop(0) speeds.pop(0) count+=1 else: if count > 0: answer.append(count) count = 0 time += 1 answer.append(count) return answer ํ์ด: ์ ์ถ๋ ฅ ์์์ ๋ํ ์ธ๊ธ์ด ์๋ค? -> ์คํ or ํ๋ฅผ ์ฌ์ฉํ๋ ๋ฌธ์ ๋ผ๊ณ ์๊ฐํ๊ณ pop์ฌ์ฉํด๋ณด๊ธฐ! ์ฒซ๋ฒ์งธ ๋ฐ๋ณต๋ฌธ์์ ๋จผ์ ์ ค ์์์๋ progress๊ฐ 100์ด ์ด์์ด ๋ ๋๊น์ง time +=1 ํด์ฃผ๊ธฐ ์ฒซ๋ฒ์งธ๊ฐ..
์ฝ๋: def solution(arr): ans = [arr[0]] for i in range(1, len(arr)): if arr[i] != arr[i-1]: ans.append(arr[i]) return ans ํ์ด: arr ๋ฐฐ์ด์ ์ ๊ฐ์ด๋๋ง ๋ค๋ฅด๋ฉด ๊ฒฐ๊ณผ๋ฐฐ์ด์ ๋ฃ์ด๋ ๋จ. ๊ทธ๋์ ์ ๊ฐ์ด๋๋ง ๋น๊ตํ๋ฉด ๋๋ค.
- Total
- Today
- Yesterday
- ์ฝ๋ฉ๊ณต๋ถ
- WGAN
- ๋ ผ๋ฌธ์ฝ๊ธฐ
- ์ฝํ ์ค๋น
- ๊ตฌ๊ธ์ฝ๋ฉ
- AIRUSH
- dreambooth
- C์ธ์ด
- Aimers
- gan
- ์ฝํ
- ํ๋ก๊ทธ๋๋จธ์ค
- ์คํ ์ด๋ธ๋ํจ์
- AIRUSH2023
- ๋ ผ๋ฌธ๋ฆฌ๋ทฐ
- ํ์ด์ฌ
- ๊ธฐ์ ์ปจํผ๋ฐ์ค
- CLOVAX
- ํ์ด์ฌ์ฝํ
- ๋๋ฆผ๋ถ์ค
- ํ ํฌ์๋ฐ
- AI์ปจํผ๋ฐ์ค
- ์ฝ๋ฉ์๋ฌ
- MYSQL
- StableDiffusion
- SQL
- DALLE
- HyperCLOVA
- SKTECHSUMMIT
- lgaimers
์ผ | ์ | ํ | ์ | ๋ชฉ | ๊ธ | ํ |
---|---|---|---|---|---|---|
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 |