-
Notifications
You must be signed in to change notification settings - Fork 2
/
q0937.swift
88 lines (86 loc) · 2.26 KB
/
q0937.swift
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
//
// q0937.swift
// LeetcodeSwift
//
// Created by NowOrNever on 24/06/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//973. K Closest Points to Origin
//Medium
//
//1734
//
//112
//
//Add to List
//
//Share
//We have a list of points on the plane. Find the K closest points to the origin (0, 0).
//
//(Here, the distance between two points on a plane is the Euclidean distance.)
//
//You may return the answer in any order. The answer is guaranteed to be unique (except for the order that it is in.)
//
//
//
//Example 1:
//
//Input: points = [[1,3],[-2,2]], K = 1
//Output: [[-2,2]]
//Explanation:
//The distance between (1, 3) and the origin is sqrt(10).
//The distance between (-2, 2) and the origin is sqrt(8).
//Since sqrt(8) < sqrt(10), (-2, 2) is closer to the origin.
//We only want the closest K = 1 points from the origin, so the answer is just [[-2,2]].
//Example 2:
//
//Input: points = [[3,3],[5,-1],[-2,4]], K = 2
//Output: [[3,3],[-2,4]]
//(The answer [[-2,4],[3,3]] would also be accepted.)
//
//
//Note:
//
//1 <= K <= points.length <= 10000
//-10000 < points[i][0] < 10000
//-10000 < points[i][1] < 10000
//Accepted
//280,560
//Submissions
//442,195
class q0937Solution {
func kClosest(_ points: [[Int]], _ K: Int) -> [[Int]] {
var result = [[Int]].init(repeating: [Int.max, -1, -1], count: K)
for point in points {
let distance = point[0] * point[0] + point[1] * point[1]
if distance < result[K - 1][0] {
var left = 0
var right = K - 1
var index = 0
while left <= right {
let mid = (left + right) >> 1
if distance <= result[mid][0] {
index = mid
right = mid - 1
}else{
left = mid + 1
}
}
result.insert([distance, point[0], point[1]], at: index)
result.removeLast()
}
}
for i in 0..<result.count {
result[i].removeFirst()
}
return result
}
}
func q0937(){
let solu = q0937Solution()
let points = [[1,3],[-2,2]]
let K = 1
let result = solu.kClosest(points, K)
print(result)
}