|
| 1 | +// ๋ฉ๋ชจ๋ฆฌ์ด๊ณผ๋ก ์ ์ ์์๋ ๊ฒ์ ์ ์ฅ ๊ณต๊ฐ์ด ์ฌ๋ฌ๊ฐ ํ์ํ๋ค๋ ๊ฑฐ ์๋ค. |
| 2 | +// ๊ทธ๋ฆฌ๊ณ ์ฃผ์ด์ง ๋ฐ์ดํฐ๊ฐ ์ ๋ ฌ๋์ง ์์์ ๋ฌด์กฐ๊ฑด nlog(n) ์ด์์ ์๊ฐ๋ณต์ก๋๊ฐ ๋์ค๊ธฐ ๋๋ฌธ์ |
| 3 | +// ์๋ ์ ๋ ฌํ ์ ์๋ ์ฐ์ ์์ ํ๋ฅผ ์ฌ์ฉํ๋ฉด ์ข๊ฒ ๋ฐ๊ณ ์๊ฐ |
| 4 | +// ๊ทธ๋ฌ๋ ๋ฐ์ดํฐ๋ฅผ ๋๋๋ ์๊ณ ๋ฆฌ์ฆ์ด ํ์ํ์ง ๋ชจ๋ฅด๊ณ ํค๋ฉ๋ค๊ฐ GPT ๋ต์ ๋ณด๊ฒ๋จ |
| 5 | +// ์๊ฐ๋ณต์ก๋ ์ฐ์ ์์ ํ : O(logN) |
| 6 | +class MedianFinder { |
| 7 | + private PriorityQueue<Integer> maxHeap; |
| 8 | + private PriorityQueue<Integer> minHeap; |
| 9 | + |
| 10 | + public MedianFinder() { |
| 11 | + maxHeap = new PriorityQueue<>(Collections.reverseOrder()); |
| 12 | + minHeap = new PriorityQueue<>(); |
| 13 | + } |
| 14 | + |
| 15 | + public void addNum(int num) { |
| 16 | + maxHeap.offer(num); |
| 17 | + |
| 18 | + if (!minHeap.isEmpty() && maxHeap.peek() > minHeap.peek()) { |
| 19 | + minHeap.offer(maxHeap.poll()); |
| 20 | + } |
| 21 | + |
| 22 | + if (maxHeap.size() > minHeap.size() + 1) { |
| 23 | + minHeap.offer(maxHeap.poll()); |
| 24 | + } else if (minHeap.size() > maxHeap.size()) { |
| 25 | + maxHeap.offer(minHeap.poll()); |
| 26 | + } |
| 27 | + } |
| 28 | + |
| 29 | + public double findMedian() { |
| 30 | + if (maxHeap.size() > minHeap.size()) { |
| 31 | + return maxHeap.peek(); |
| 32 | + } else { |
| 33 | + return (maxHeap.peek() + minHeap.peek()) / 2.0; |
| 34 | + } |
| 35 | + } |
| 36 | +} |
| 37 | + |
| 38 | +// ๋ฉ๋ชจ๋ฆฌ์ด๊ณผ |
| 39 | +class MedianFinder { |
| 40 | + private List<Integer> arr; |
| 41 | + |
| 42 | + public MedianFinder() { |
| 43 | + arr = new ArrayList<>(); |
| 44 | + } |
| 45 | + |
| 46 | + public void addNum(int num) { |
| 47 | + arr.add(num); |
| 48 | + } |
| 49 | + |
| 50 | + public double findMedian() { |
| 51 | + Collections.sort(arr); |
| 52 | + |
| 53 | + int size = arr.size(); |
| 54 | + if (size % 2 == 1) { |
| 55 | + return arr.get(size / 2); |
| 56 | + } else { |
| 57 | + return (arr.get(size / 2 - 1) + arr.get(size / 2)) / 2.0; |
| 58 | + } |
| 59 | + } |
| 60 | +} |
0 commit comments