algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-19 17:54:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

docs: update the whole repository

Browse Source 
* fix some bugs
* delete duplicate files
* format code
This commit is contained in:
yanglbme
2019-05-09 19:32:54 +08:00
parent 163db8521a
commit 29948363da
368 changed files with 4372 additions and 30841 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
Misc/MedianOfRunningArray.java
View File

@ -1,10 +1,12 @@
package Misc;
import java.util.Collections;
import java.util.PriorityQueue;
/**********************
author: shrutisheoran
***********************/
/**
* @author shrutisheoran
*/
public class MedianOfRunningArray {
private PriorityQueue<Integer> p1;
private PriorityQueue<Integer> p2;
@ -21,7 +23,7 @@ public class MedianOfRunningArray {
*/
public void insert(Integer e) {
p2.add(e);
if(p2.size() - p1.size() > 1)
if (p2.size() - p1.size() > 1)
p1.add(p2.remove());
}
@ -29,9 +31,9 @@ public class MedianOfRunningArray {
Returns median at any given point
*/
public Integer median() {
if(p1.size()==p2.size())
return (p1.peek() + p2.peek())/2;
return p1.size()>p2.size() ? p1.peek() : p2.peek();
if (p1.size() == p2.size())
return (p1.peek() + p2.peek()) / 2;
return p1.size() > p2.size() ? p1.peek() : p2.peek();
}
public static void main(String[] args) {
@ -41,7 +43,7 @@ public class MedianOfRunningArray {
MedianOfRunningArray p = new MedianOfRunningArray();
int arr[] = {10, 7, 4, 9, 2, 3, 11, 17, 14};
for(int i = 0 ; i < 9 ; i++) {
for (int i = 0; i < 9; i++) {
p.insert(arr[i]);
System.out.print(p.median() + " ");
}