๋ชฉ๋ก์ด๋ถ„ํƒ์ƒ‰ (1)

J

upper bound, lower bound : ์ด๋ถ„ํƒ์ƒ‰

๐Ÿ“Œ Lower Bound(์ƒ๊ณ„) ์ •๋ ฌ๋˜์–ด ์žˆ๋Š” ๋ฐ์ดํ„ฐ set์—์„œ K๊ฐ’ ์ด์ƒ์ด ์ฒ˜์Œ ๋ฐœ๊ฒฌ๋˜๋Š” ์œ„์น˜๋ฅผ ์˜๋ฏธํ•œ๋‹ค. ๐Ÿ“Œ Upper Bound(ํ•˜๊ณ„) ์ •๋ ฌ๋˜์–ด ์žˆ๋Š” ๋ฐ์ดํ„ฐ set์—์„œ K๊ฐ’๋ณด๋‹ค ํฐ ๊ฐ’์ด ์ฒ˜์Œ ๋ฐœ๊ฒฌ๋˜๋Š” ์œ„์น˜๋ฅผ ์˜๋ฏธํ•œ๋‹ค. ๐Ÿ’ก ์˜ˆ๋ฅผ ๋“ค์–ด 1 2 2 3 3 3 4 5 ์˜ ๋ฐ์ดํ„ฐ set์—์„œ lower bound(3) = 3, upper bound(3) = 6 @ ๋ฐ์ดํ„ฐ set์˜ index๋Š” 0์—์„œ๋ถ€ํ„ฐ, lower bound(์ฐพ๊ณ ์ž ํ•˜๋Š” ์ˆซ์ž = K) โœ… ์ด๋ถ„ ํƒ์ƒ‰์„ ์ด์šฉํ•˜์—ฌ upper bound, lower bound๋ฅผ ๊ตฌํ•ด ๋ณด์ž! ## lower bound int start = 0; int end = N-1; while(start
๐Ÿ”‘ Problem Solving/๐Ÿฅ• Algorithm 2023. 4. 3. 12:09
์ด์ „ Prev 1 Next ๋‹ค์Œ