-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path0973-KClosestPointsToOrigin.cs
68 lines (58 loc) · 2.01 KB
/
0973-KClosestPointsToOrigin.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
//-----------------------------------------------------------------------------
// Runtime: 424ms
// Memory Usage: 48.5 MB
// Link: https://leetcode.com/submissions/detail/346861360/
//-----------------------------------------------------------------------------
using System;
namespace LeetCode
{
public class _0973_KClosestPointsToOrigin
{
private readonly Random random = new Random();
public int[][] KClosest(int[][] points, int K)
{
Sort(points, 0, points.Length - 1, K);
var result = new int[K][];
Array.Copy(points, 0, result, 0, K);
return result;
}
private void Sort(int[][] points, int lo, int hi, int k)
{
if (lo >= hi) return;
var randomIndex = random.Next(lo, hi);
Swap(points, lo, randomIndex);
var mid = Partition(points, lo, hi);
var length = mid - lo + 1;
if (length > k)
Sort(points, lo, mid - 1, k);
else
Sort(points, mid + 1, hi, k - length);
}
private int Partition(int[][] points, int lo, int hi)
{
int i = lo, j = hi + 1;
var pivotDistance = GetDistance(points, lo);
while (true)
{
while (GetDistance(points, ++i) < pivotDistance) if (i == hi) break;
while (GetDistance(points, --j) > pivotDistance) if (j == lo) break;
if (i >= j) break;
Swap(points, i, j);
}
Swap(points, lo, j);
return j;
}
private int GetDistance(int[][] points, int i)
{
return points[i][0] * points[i][0] + points[i][1] * points[i][1];
}
private void Swap(int[][] points, int i, int j)
{
int t0 = points[i][0], t1 = points[i][1];
points[i][0] = points[j][0];
points[i][1] = points[j][1];
points[j][0] = t0;
points[j][1] = t1;
}
}
}