-
Notifications
You must be signed in to change notification settings - Fork 2
/
q1492.swift
70 lines (69 loc) · 1.55 KB
/
q1492.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
//
// q5433.swift
// LeetcodeSwift
//
// Created by NowOrNever on 27/06/2020.
// Copyright © 2020 DL. All rights reserved.
//
import Foundation
//1492. The kth Factor of n
//User Accepted:1675
//User Tried:1755
//Total Accepted:1680
//Total Submissions:1941
//Difficulty:Medium
//Given two positive integers n and k.
//
//A factor of an integer n is defined as an integer i where n % i == 0.
//
//Consider a list of all factors of n sorted in ascending order, return the kth factor in this list or return -1 if n has less than k factors.
//
//
//
//Example 1:
//
//Input: n = 12, k = 3
//Output: 3
//Explanation: Factors list is [1, 2, 3, 4, 6, 12], the 3rd factor is 3.
//Example 2:
//
//Input: n = 7, k = 2
//Output: 7
//Explanation: Factors list is [1, 7], the 2nd factor is 7.
//Example 3:
//
//Input: n = 4, k = 4
//Output: -1
//Explanation: Factors list is [1, 2, 4], there is only 3 factors. We should return -1.
//Example 4:
//
//Input: n = 1, k = 1
//Output: 1
//Explanation: Factors list is [1], the 1st factor is 1.
//Example 5:
//
//Input: n = 1000, k = 3
//Output: 4
//Explanation: Factors list is [1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 1000].
//
//
//Constraints:
//
//1 <= k <= n <= 1000
class q1492Solution {
func kthFactor(_ n: Int, _ k: Int) -> Int {
if k == 1 {
return 1
}
var count = 1
for i in 2...n {
if n % i == 0 {
count += 1
if count == k {
return i
}
}
}
return -1
}
}