๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ

๋ฐ˜์‘ํ˜• ์›น์‚ฌ์ดํŠธ ์ œ์ž‘์€ ์ด์ œ ๊ทธ๋ƒฅ ํ•„์ˆ˜์ด๋‹ค. ๋ฏธ๋””์–ด์ฟผ๋ฆฌ ์ž‘์—…์„ ํ•  ๋•Œ ํ•ญ์ƒ ๋ธŒ๋ ˆ์ดํฌ ํฌ์ธํŠธ๋ฅผ ์žก๋Š” ๊ฒƒ์ด ์• ๋งคํ•˜๋‹ค๋ผ๊ณ  ์ƒ๊ฐํ•˜๋Š”๋ฐ์šฐ์„ ์€ 768px ์ตœ์†Œ๋กœ ํ–ˆ์„ ๊ฒฝ์šฐ๋ฅผ ๋‘๊ณ  ์ž‘์—…์— ๋“ค์–ด๊ฐ”๋‹ค.  shadcn/ui ์ด๋ž€?Radix UI ๋ฐ Tailwind CSS๋ฅผ ์‚ฌ์šฉํ•˜์—ฌ ๊ตฌ์ถ•๋œ ์žฌ์‚ฌ์šฉ ๊ฐ€๋Šฅํ•œ ์ปดํฌ๋„ŒํŠธ. ์ปดํฌ๋„ŒํŠธ ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ๊ฐ€ ์•„๋‹Œ ์•ฑ์— copy and paste ํ•˜์—ฌ ์žฌ์‚ฌ์šฉ ๊ฐ€๋Šฅํ•œ ๊ตฌ์„ฑ์š”์†Œ ๋ชจ์Œ์ด๋‹ค. npm install ์„ ํ•˜์—ฌ ์ข…์†์„ฑ ์„ค์น˜๋ฅผ ํ•˜์ง€ ์•Š๋Š”๋‹ค๋Š” ์ด์•ผ๊ธฐ๋‹ค. tailwind css๋ฅผ ๊ธฐ๋ฐ˜์œผ๋กœ ํ•˜๊ณ  ์žˆ๋‹ค. ์ปค์Šคํ…€์„ ํ•  ๋• tailwind css ๋ฒ•์น™์„ ๋”ฐ๋ฅด๋ฉด ๋œ๋‹ค.  ์‚ฌ์šฉํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” Nextjs , tailwind css ๊ฐ€ ์„ค์น˜๋˜์–ด์žˆ์–ด์•ผํ•œ๋‹ค. ๋‹ค ๊ฐ์„คํ•˜๊ณ  shadcn/ui๋ฅผ ์“ฐ๋ฉด์„œ ๋ฏธ๋””์–ด์ฟผ๋ฆฌ ์ž‘์—…์„ ..
๊ฐœ์ธ์ ์ธ ํ•„์š”๋กœ ์ธํ•ด์„œ ๋งŒ๋“ค๊ธฐ ์‹œ์ž‘ํ–ˆ๋˜ ํƒ€์ž„ ํŠธ๋ž˜ํ‚น ์›น. ๋…์„œํ•˜๋Š” ์‹œ๊ฐ„์„ ๋งŒ๋“ค์–ด๋ณด๊ณ  ์ธก์ •ํ•ด๋ณด๊ฒ ๋‹ค๊ณ  ์‹œ์ž‘ํ•œ ๊ฒƒ์ด์˜€๋Š”๋ฐ ์ง€๋‚œ ๋‹ฌ ๊ธฐ๋ก๊ณผ ํ˜„์žฌ์˜ ๊ธฐ๋ก ๋น„๊ต / ๋˜๋Š” ๋ชฉํ‘œ ์‹œ๊ฐ„์„ ์ •ํ•ด๋‘๊ณ  ํ˜„์žฌ ์–ผ๋งˆ๋‚˜ ์ด๋ค˜๋Š”์ง€ ์ฒดํฌํ•˜๋Š” ๋ถ€๋ถ„๊นŒ์ง€ ๋” ํ•ด๋ณด๊ณ  ์‹ถ์–ด์กŒ๋‹ค. ๊ทธ ํ‘œํ˜„์„ progressbar๋กœ ํ•˜๋ฉด ์ง๊ด€์ ์ผ ๊ฒƒ ๊ฐ™๋‹ค๊ณ  ์ƒ๊ฐํ–ˆ๊ณ , nextui๋ฅผ ์‚ฌ์šฉํ•ด์„œ ๊ฐ„๋‹จํ•˜๊ฒŒ ์ ์šฉํ•ด๋ณด๊ธฐ๋กœ ํ–ˆ๋‹ค.    ๐Ÿ‘‡๐Ÿป NextUI ๊ณต์‹๋ฌธ์„œ https://nextui.org/ NextUI - Beautiful, fast and modern React UI LibraryBeautiful, fast and modern React UI Librarynextui.org nextui๋ฅผ ์ ์šฉํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” ๊ณต์‹๋ฌธ์„œ๋ฅผ ๋ณด๋ฉด ๊ต‰์žฅํžˆ ๋น ๋ฅด๊ฒŒ ํ•ด๊ฒฐํ•  ์ˆ˜ ์žˆ๋‹ค. ๊ต‰์žฅํžˆ ..
์ž๋ฐ”์Šคํฌ๋ฆฝํŠธ์—์„œ ๋ฐ์ดํ„ฐ๋ฅผ ๋‹ด๊ณ  ์‚ฌ์šฉํ•˜๋Š”๋ฐ ์ด์šฉ๋˜๋Š” ๋ฐฐ์—ด๊ณผ ์ด๋ฅผ loop์œผ๋กœ ์ฒ˜๋ฆฌํ•˜๊ธฐ ์œ„ํ•ด์„œ forEach()์™€ map()์„ ์ฃผ๋กœ ์‚ฌ์šฉํ•œ๋‹ค.  forEach()Array ์ธ์Šคํ„ด์Šค forEach() ๋ฉ”์„œ๋“œ๋Š” ์ˆœํšŒ ๋ฉ”์„œ๋“œ๋กœ ๊ฐ ๋ฐฐ์—ด ์š”์†Œ์— ๋Œ€ํ•ด ์ œ๊ณต๋œ ์ฝœ๋ฐฑ ํ•จ์ˆ˜๋ฅผ ํ•œ ๋ฒˆ์”ฉ ์‹คํ–‰ํ•œ๋‹ค.๋ฐ˜ํ•œ ๊ฐ’์€ ์‚ฌ์šฉ๋˜์ง€ ์•Š๋Š”๋‹ค.ํ˜ธ์ถœ๋˜๋Š” ๋ฐฐ์—ด์„ ๋ณ€๊ฒฝํ•˜์ง€ ์•Š์ง€๋งŒ, ์ฝœ๋ฐฑ ํ•จ์ˆ˜๋กœ ์ œ๊ณต๋˜๋Š” ํ•จ์ˆ˜๋Š” ๋ณ€๊ฒฝ ํ•  ์ˆ˜ ์žˆ๋‹ค.๊ทธ๋Ÿฌ๋‚˜ ๋ฐฐ์—ด์˜ length๋Š” ์ฝœ๋ฐฑํ•จ์ˆ˜๋ฅผ ์ฒ˜์Œ ํ˜ธ์ถœํ•˜๊ธฐ ์ „์— ์ €์žฅ๋œ๋‹ค๋Š” ์ ์„ ์œ ์˜ํ•ด์•ผํ•จ.๊ทธ๋ฆฌ๊ณ  ๋ฃจํ”„๋ฅผ ์ค‘์ง€ํ•˜๊ฑฐ๋‚˜ ์ค‘๋‹จํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•์ด ์—†๋‹ค. const array1 = ['a', 'b', 'c'];array1.forEach((element) => console.log(element));// Expected output: "a"..
naver์—์„œ ๋ฐœํ–‰ํ•˜๋Š” FE News๋ผ๋Š” ๋‰ด์Šค๋ฅผ ๊ตฌ๋… ์ค‘์ธ๋ฐ, ์ตœ๊ทผ์— ๋ฐ›์€ ์ด๋ฉ”์ผ ์ค‘์—์„œ ํฅ๋ฏธ๋กœ์šด ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ๋ฅผ ๋ฐœ๊ฒฌํ•ด์„œ ํ•œ๋ฒˆ ์ฝ์–ด๋ณด์•˜๋‹ค. es-hangul ์ด๋ผ๋Š” ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ์ธ๋ฐ, toss์—์„œ ๊ณต๊ฐœํ•œ ๊ฒƒ์œผ๋กœ ํ•œ๊ธ€์„ ์‰ฝ๊ฒŒ ๋‹ค๋ฃฐ์ˆ˜ ์žˆ๋„๋ก ๋•๋Š” Javascript ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ๋ž๋‹ˆ๋‹ค.์ดˆ์„ฑ๊ฒ€์ƒ‰, ์กฐ์‚ฌ๋ถ™์ด๊ธฐ ๊ฐ™์€ ํ•œ๊ธ€์ž‘์—…์„ ๊ฐ„๋‹จํ•˜๊ฒŒ ํ•  ์ˆ˜ ์žˆ๋Š” ๊ธฐ๋Šฅ์„ ์ œ๊ณตํ•ฉ๋‹ˆ๋‹ค. ๋งค๋ฒˆ ์˜คํ”ˆ์†Œ์Šค ๊ธฐ์—ฌํ•˜๊ธฐ๋ฅผ ํ•ด๋ด์•ผ์ง€, ํ˜น์€ ์˜คํ”ˆ์†Œ์Šค๋ฅผ ์ฝ์–ด๋ด์•ผ์ง€! ์ƒ๊ฐํ•˜๋ฉฐ ํ•ด๋ณผ๋ ค๊ณ  ์‹œ๋„๋ฅผ ํ•˜๋ฉด ์Ÿ์•„์ง€๋Š” ์˜์–ด์™€ ์—„์ฒญ๋‚œ ๋Ÿ‰์˜ ํŒŒ์ผ์ˆ˜์— ์••๋„๋˜์–ด์„œ ๋Š˜ back์„ ๋ˆŒ๋ €๋Š”๋ฐ ์ด๋ฒˆ์—๋Š” ์™ ์ง€ ์‹œ๋„ํ•ด๋ณผ๋งŒํ•œ๋ฐ? ๋ผ๋Š” ์ƒ๊ฐ์ด ๋“ค์–ด์„œ ํ•œ๋ฒˆ ์ „์ฒด์ ์ธ ํ”„๋กœ์ ํŠธ๋ฅผ ์‚ดํŽด๋ดค์Šต๋‹ˆ๋‹ค.    ์˜คํ”ˆ์†Œ์Šค ํ”„๋กœ์ ํŠธ ๋ณด๋Š” ๋ฐฉ๋ฒ•1. README ๋ฅผ ์ฒœ์ฒœํžˆ ์ฝ์–ด๋ด๋ผ 2. ์ฒซ๋ฒˆ์งธ๋กœ ๋ด์•ผ ํ•  ํŒŒ์ผ์€ pa..
Big O Notation (๋น… ์˜ค ํ‘œ๊ธฐ๋ฒ•)์ปดํ“จํ„ฐ ๊ณผํ•™์ž๋Š” ์„œ๋กœ ๊ฐ„์— ์‹œ๊ฐ„ ๋ณต์žก๋„๋ฅผ ์‰ฝ๊ฒŒ ์†Œํ†ตํ•  ๋ชฉ์ ์œผ๋กœ ์ž๋ฃŒ๊ตฌ์กฐ์™€ ์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ํšจ์œจ์„ฑ์„ ๊ฐ„๊ฒฐํ•˜๊ณ  ์ผ๊ด€๋œ ์–ธ์–ด๋กœ ์„ค๋ช…ํ•˜๊ธฐ ์œ„ํ•ด ์ˆ˜ํ•™์  ๊ฐœ๋…์„ ์ฐจ์šฉํ–ˆ๋‹ค. ์ด๋Ÿฐ ๊ฐœ๋…์„ ํ˜•์‹ํ™”ํ•œ ๊ฒƒ์ด ๋น… ์˜ค ํ‘œ๊ธฐ๋ฒ”์ด๋ฉฐ. ์ด๊ฒƒ์„ ์‚ฌ์šฉํ•ด์—ฌ ์ฃผ์–ด์ง„ ์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ํšจ์œจ์„ฑ์„ ์‰ฝ๊ฒŒ ๋ถ„๋ฅ˜ํ•˜๊ณ  ์ดํ•ด์‹œํ‚ฌ ์ˆ˜ ์žˆ๋‹ค. ๊ฐ„๋‹จํ•˜๊ฒŒ ๋งํ•˜์ž๋ฉด ์•Œ๊ณ ๋ฆฌ์ฆ˜์˜ ํšจ์œจ์„ฑ์„ ๋ถ„์„ํ•˜๊ธฐ ์œ„ํ•ด ์ปดํ“จํ„ฐ ๊ณตํ•™์ž๋“ค์ด ์“ฐ๋Š” ๊ฐ€์žฅ ๊ธฐ๋ณธ์ ์ธ ๋„๊ตฌ ์ค‘ ํ•˜๋‚˜์ด๋‹ค. ๋น… ์˜ค๋Š” ํŠน์ • ๋ฐฉ์‹์œผ๋กœ ์•Œ๊ณ ๋ฆฌ์ฆ˜์— ํ•„์š”ํ•œ ๋‹จ๊ณ„ ์ˆ˜๋ฅผ ๊ณ ๋ คํ•จ์œผ๋กœ์จ ์ผ๊ด€์„ฑ์„ ์œ ์ง€ํ•œ๋‹ค. ๊ทธ๋ฆฌ๊ณ  ๋‹จ์ˆœํžˆ ์•Œ๊ณ ๋ฆฌ์ฆ˜์— ํ•„์š”ํ•œ ๋‹จ๊ณ„ ์ˆ˜๋งŒ ์•Œ๋ ค์ฃผ์ง€ ์•Š๋Š”๋‹ค. ๋ฐ์ดํ„ฐ๊ฐ€ ๋Š˜์–ด๋‚  ๋•Œ ๋‹จ๊ณ„ ์ˆ˜๊ฐ€ ์–ด๋–ป๊ฒŒ ์ฆ๊ฐ€ํ•˜๋Š”์ง€ ์„ค๋ช…ํ•œ๋‹ค.  ๋น… ์˜ค ์นดํ…Œ๊ณ ๋ฆฌO(N) : ์„ ํ˜•์‹œ๊ฐ„์„ ๊ฐ–๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜. ๋ฐ์ดํ„ฐ ์ค‘๊ฐ€๊ฐ€ ์„ฑ๋Šฅ์— ..
์š”์ฆ˜ ๋“ค์–ด ๊ฐ€์Šด ๊นŠ์ด ์ƒˆ๊ธฐ๊ณ  ์žˆ๋Š” ๋ง์ด๋‹ค. '์กด๋ฒ„' 1. ์•„์นจ์— ๋ˆˆ์„ ๋œจ๋ฉด ์Œ“์—ฌ์žˆ๋Š” ๋ฉ”์ผ ์†์—์„œ ์„œ๋ฅ˜ํƒˆ๋ฝ ๋ฉ”์ผ์„ ๋ฐœ๊ฒฌํ•œ๋‹ค. ๊ทธ๊ฒŒ ๋ฐ˜๋ณต์ด ๋˜๋ฉด์„œ ํ•˜๋ฃจ์˜ ๊ธฐ๋ถ„์„ ์ขŒ์ง€์šฐ์ง€ํ•˜๋Š” ๋‚˜๋‚ ๋“ค๋„ ์ƒ๊ธฐ์ž ์ด์ œ๋Š” ์˜ค์ „ ์ผ์ฐ๋ถ€ํ„ฐ๋Š” ์ด๋ฉ”์ผ์„ ํ™•์ธํ•˜์ง€ ์•Š๋Š”๋‹ค. ์ผ์–ด๋‚˜์„œ ์–‘์น˜๋ฅผ ํ•˜๊ณ  ํ•˜๋ฃจ๋ฅผ ์‹œ์ž‘ํ•˜๊ณ  ๋‚˜์„œ ๋ฉ”์ผํ•จ์„ ํ™•์ธํ•œ๋‹ค. ๋ชจ๋“  ๊ฒƒ์—๋Š” ํƒ€์ด๋ฐ์ด ์žˆ๊ณ  ๋‚˜์˜ ๋ถ€์กฑํ•จ์ด ์•„๋‹ ๊ฒƒ์ด๋ผ๋ฉฐ ์Šค์Šค๋กœ๋ฅผ ๋‹ค์žก์ง€๋งŒ ๋ฐ˜๋ณต๋˜๋Š” ํƒˆ๋ฝ ๋ฉ”์ผ์€ ๊ทธ ๋งˆ์ €๋„ ๋ฌด๋„ˆ์ง€๊ฒŒ ๋งŒ๋“ ๋‹ค. ์˜ค์ผ€์ด. ์–ด์ฉŒ๋ฉด ๋ถ€์กฑํ• ์ง€๋„. ์„ธ์ƒ์— ์™„๋ฒฝํ•œ ์‚ฌ๋žŒ์ด ์–ด๋””์žˆ๋Š”๋ฐ? ๋ผ๋Š” ์ƒ๊ฐ์„ ํ•˜๋ฉฐ ๋ฒ„ํ‹ฐ๋ฉฐ ์•ž์œผ๋กœ ๋‚˜์•„๊ฐ€์ž๋ผ๊ณ  ์˜ค๋Š˜๋„ ์ƒ๊ฐํ•œ๋‹ค. 2. ์•Œ๊ณ ๋ฆฌ์ฆ˜ ๊ณต๋ถ€๋ฅผ ๋ฆฟ์ฝ”๋“œ๋กœ ํ•˜๊ณ  ์žˆ๋‹ค. ๋ฆฟ์ฝ”๋“œ๋กœ ํ•˜๋Š” ์ด์œ ๋Š” ๊นƒํ—™์ด๋ž‘ ์—ฐ๋™์ด ๊ฐ€๋Šฅํ•˜๋‹ค๋ณด๋‹ˆ ๊ธฐ๋กํ•˜๊ธฐ ํŽธํ•ด์„œ์ธ๋ฐ ์–ผ๋งˆ๋‚˜ ํ’€์–ด๋ดค๋‚˜ ๋ผ๊ณ  ๋ดค๋”๋‹ˆ easy ๋ ˆ๋ฒจ๋งŒ ์—„์ฒญ ํ’€..
ํ”„๋กœ์ ํŠธ ๊ตฌํ˜„์„ ์ง„ํ–‰ํ•˜๋ฉด์„œ ์ƒˆ๋กœ์šด ํŽ˜์ด์ง€๋ฅผ ๋งŒ๋“ค์—ˆ๋‹ค. ์„œ๋ฒ„์— ์ €์žฅ๋˜์–ด์žˆ๋Š” ๋ฐ์ดํ„ฐ๋ฅผ ๊ฐ€์ ธ์˜ค๊ธฐ ์œ„ํ•ด์„œ ์ด๋ฏธ ๋งŒ๋“ค์–ด์ ธ์žˆ๋˜ ๋ฐ์ดํ„ฐ ํ˜ธ์ถœ ์ฝ”๋“œ๋“ค์„ ๊ทธ๋Œ€๋กœ ์žฌํ™œ์šฉํ•ด์„œ ์ง„ํ–‰์„ ํ–ˆ๋Š”๋ฐ ๊ฐœ๋ฐœ๋ชจ๋“œ์—์„œ๋Š” ๊ดœ์ฐฎ์•˜์ง€๋งŒ ๋นŒ๋“œ๋งŒ ํ•˜๋ฉด ๊ณ„์†ํ•ด์„œ ์˜ค๋ฅ˜๊ฐ€ ๋‚ฌ๋‹ค. ์ •ํ™•ํžˆ๋Š” ์ •์  ๋ Œ๋”๋งํ•˜๋Š” ํŽ˜์ด์ง€์—์„œ ๊ณ„์† ์˜ค๋ฅ˜๊ฐ€ ๋‚˜๋Š” ์ƒํ™ฉ ๋ฐ์ดํ„ฐ๋ฅผ ๋ถˆ๋Ÿฌ์˜ฌ ๋•Œ ํ˜ธ์ถœํ•œ๊ฒŒ ์„œ๋ฒ„API๋ฅผ ๋”ฐ๋กœ ๋งŒ๋“ ๊ฒŒ ์•„๋‹ˆ๋ผ nextjs๊ฐ€ ์ง€์›ํ•˜๋Š” api route๋ฅผ ์ด์šฉํ•ด์„œ severless ํ•œ ํ•จ์ˆ˜๋กœ ๊ตฌํ˜„ํ–ˆ๋‹ค. ์ฐธ๊ณ ๋กœ API ๋ผ์šฐํŠธ๋ฅผ ์‚ฌ์šฉํ•˜๋ฉด Next.js ์–ดํ”Œ๋ฆฌ์ผ€์ด์…˜์—์„œ ์™ธ๋ถ€ ๋ฐ์ดํ„ฐ๋ฅผ ๊ฐ€์ ธ์˜ค๊ฑฐ๋‚˜ ๋ฐ์ดํ„ฐ๋ฒ ์ด์Šค์™€ ์ƒํ˜ธ์ž‘์šฉํ•  ์ˆ˜ ์žˆ๋‹ค. ์ด ๋ถ€๋ถ„์„ ์ดํ•ดํ•˜๊ธฐ ์œ„ํ•ด์„œ๋Š” nextjs์˜ ์„œ๋ฒ„ ๋ Œ๋”๋ง์— ๋Œ€ํ•ด์„œ ์•Œ ํ•„์š”๊ฐ€ ์žˆ๋‹ค. nextjs ์„œ๋ฒ„ ๋ Œ๋”๋ง์—๋Š” ์ด 3๊ฐ€์ง€๊ฐ€ ์žˆ๋Š”๋ฐ, ์ฒซ๋ฒˆ์งธ Stat..
ํ‡ด์‚ฌํ•œ ์ง€ ํ•œ ๋‹ฌ์ด ์ง€๋‚˜๊ฐ€๋Š” ์‹œ์ ์ธ 2์›” ๋‚˜๋Š” ๋ฌด์—‡์„ ํ–ˆ๋Š”๊ฐ€ ์„œ๋ฅ˜ ํƒˆ๋ฝ๊ณผ ๋ฉด์ ‘ ๊ทธ๋ฆฌ๊ณ  ์ฝ”ํ…Œ ์ด ์ด์•ผ๊ธฐ ๋ง๊ณ ๋Š” ํ•  ๊ฒŒ ์—†๋Š” ํ•œ ๋‹ฌ์ธ ๊ฒƒ ๊ฐ™๊ธฐ๋„. ์„œ๋ฅ˜ ํƒˆ๋ฝ๋„ ๊ฝค ํ•˜๊ณ , ๋ฉด์ ‘๋„ ๋ณด๊ณ  ์ฝ”ํ…Œ๋„ ๋ณด๋ฉฐ ์ด๋ ฅ์„œ๋ฅผ ์ˆ˜์ •ํ•˜๋ฉฐ ์ง€๋‚ธ ๊ฒƒ ๊ฐ™๋‹ค. ๋ฉด์ ‘์„ ํ†ตํ•ด์„œ ๋ถ€์กฑํ•œ ์ ์— ๋Œ€ํ•ด์„œ ์ž๊ดด๊ฐ์— ๋น ์ง€๊ธฐ๋„ ํ–ˆ๊ณ  ์ฝ”ํ…Œ๋ฅผ ๋ณด๊ณ  ํ›„ํšŒ๋ผ๋Š” ๊ฒƒ๋„ ํ•˜๊ณ . ํ•œ ๋‹ฌ ์ƒˆ์— ๋‹ค์–‘ํ•œ 'ํฌ๋กœ์• ๋ฝ'์„ ๊ฒฝํ—˜ํ–ˆ๋‹ค. ๋‹ค์–‘ํ•œ ์ง๊ตฐ์—์„œ ์ผ์„ ํ–ˆ๋˜ ๋‚˜๋Š” ๋‚˜๋ฅผ ์ด์•ผ๊ธฐํ•˜๋Š”๋ฐ ๊ฝค๋‚˜ ์ž์‹ ์ด ์žˆ๋‹ค๊ณ  ์ƒ๊ฐํ–ˆ๋Š”๋ฐ. ๋‚˜ ์ž์‹ ์„ '์ฆ๋ช…' ํ•ด์•ผ ํ•˜๋Š” ์ผ์—” ์•„์ง ์„œํˆฌ๋ฅธ๊ฐ€ ๋ณด๋‹ค. ์•„์ง์€ ๋งŽ์ด ์ถ”์šด๋“ฏํ•œ ์ด์ง์‹œ์žฅ. ํ•˜๋ฃจ๋Š” ์ฃผ๋‹ˆ์–ด๋กœ ์ฑ„์šด ๊ฒฝ๋ ฅ์€ ๋„์›€์ด ์•ˆ ๋˜๋Š”๊ฑด๊ฐ€, ์•„๋‹ˆ๋ฉด ๋‚ด๊ฐ€ ์ œ๋Œ€๋กœ ํ™œ์šฉํ•˜์ง€ ๋ชปํ•˜๋Š” ๊ฑด๊ฐ€? ํ•˜๋Š” ๋”œ๋ ˆ๋งˆ์— ๋น ์ง€๊ธฐ๋„ ํ–ˆ๊ณ , ํ•˜๋ฃจ๋Š” ์—ด์‹ฌํžˆ ์‚ด์•„์™”์œผ๋‹ˆ ๋„ˆ๋ฌด ๊ฑฑ์ •๋ง์ž ์•„์ง ๊ทธ๋ƒฅ ๋•Œ๊ฐ€ ..
๋ฌธ์ œ You are given two 2D integer arrays, items1 and items2, representing two sets of items. Each array items has the following properties: items[i] = [valuei, weighti] where valuei represents the value and weighti represents the weight of the ith item. The value of each item in items is unique. Return a 2D integer array ret where ret[i] = [valuei, weighti], with weighti being the sum of weights o..
๋ฌธ์ œ Given a square matrix mat, return the sum of the matrix diagonals. Only include the sum of all the elements on the primary diagonal and all the elements on the secondary diagonal that are not part of the primary diagonal. Example 1: Input: mat = [[1,2,3], [4,5,6], [7,8,9]] Output: 25 Explanation: Diagonals sum: 1 + 5 + 9 + 3 + 7 = 25 Notice that element mat[1][1] = 5 is counted only once. Exa..
๋ฌธ์ œ You are given an array of strings names, and an array heights that consists of distinct positive integers. Both arrays are of length n. For each index i, names[i] and heights[i] denote the name and height of the ith person. Return names sorted in descending order by the people's heights. Example 1: Input: names = ["Mary","John","Emma"], heights = [180,165,170] Output: ["Mary","Emma","John"] E..
๋ฌธ์ œ Find all valid combinations of k numbers that sum up to n such that the following conditions are true: Only numbers 1 through 9 are used. Each number is used at most once. Return a list of all possible valid combinations. The list must not contain the same combination twice, and the combinations may be returned in any order. Example 1: Input: k = 3, n = 7 Output: [[1,2,4]] Explanation: 1 + 2 ..
๋ฐ(Ming) ๐Ÿฐ
'๋ถ„๋ฅ˜ ์ „์ฒด๋ณด๊ธฐ' ์นดํ…Œ๊ณ ๋ฆฌ์˜ ๊ธ€ ๋ชฉ๋ก (2 Page)