Commitc4c63f5

authored

Merge pull requestneetcode-gh#1289 from ShrujanKotturi/main

File(s) Modified: 973-K-Closest-Points-to-Origin.cs

2 parents677d705 +54b2ec2 commitc4c63f5Copy full SHA for c4c63f5

File tree

+44

-0

lines changed

+44

-0

lines changed

Lines changed: 44 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,44 @@`
	`1`	`+publicclassSolution{`
	`2`	`+// Closest to origin minHeap`
	`3`	`+privatePriorityQueue<int[],double>pq;`
	`4`	`+privateintsize;`
	`5`	`+// T: O(Max(M, KLogM)), S: O(k)`
	`6`	`+publicint[][]KClosest(int[][]points,intk){`
	`7`	`+pq=newPriorityQueue<int[],double>();`
	`8`	`+size=k;`
	`9`	`+`
	`10`	`+AddToPriorityQueue(points);`
	`11`	`+`
	`12`	`+returnClosest();`
	`13`	`+}`
	`14`	`+`
	`15`	`+publicclassMaxHeap:IComparer<double>{`
	`16`	`+publicintCompare(doublex,doubley){`
	`17`	`+if(x<y)return1;å`
	`18`	`+elseif(x>y)return-1;`
	`19`	`+elsereturn0;`
	`20`	`+}`
	`21`	`+}`
	`22`	`+`
	`23`	`+// T: O(M)`
	`24`	`+privatevoidAddToPriorityQueue(int[][]points){`
	`25`	`+foreach(varpointinpoints){`
	`26`	`+//var value = (double) Math.Sqrt(point[0]point[0] + point[1]point[1]);`
	`27`	`+varvalue=(double)point[0]point[0]+point[1]point[1];`
	`28`	`+pq.Enqueue(point,value);`
	`29`	`+`
	`30`	`+`
	`31`	`+}`
	`32`	`+}`
	`33`	`+`
	`34`	`+// T: O(KLogM)`
	`35`	`+privateint[][]Closest(){`
	`36`	`+varresult=newList<int[]>();`
	`37`	`+while(size>0){`
	`38`	`+result.Add(pq.Dequeue());`
	`39`	`+size--;`
	`40`	`+}`
	`41`	`+`
	`42`	`+returnresult.ToArray();`
	`43`	`+}`
	`44`	`+}`

Comments

(0)