-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path8_part1.swift
63 lines (54 loc) · 1.51 KB
/
8_part1.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
import Glibc
var matrix: [[Int]] = [[Int]]()
var indexes: [[Int]] = [[Int]]()
var line = 0
while let thing = readLine() {
matrix.append([])
for char in thing {
matrix[line].append(char.wholeNumberValue ?? 0)
}
line += 1
}
//right
var height = [Int](repeating: -1, count: matrix.count)
for j in 0...(matrix.count-1) {
for k in 0...(matrix.count-1) {
if (matrix[j][k] > height[k]) {
indexes.append([j,k])
height[k] = matrix[j][k]
}
}
}
//left
height = [Int](repeating: -1, count: matrix.count)
for j in (0...(matrix.count-1)).reversed() {
for k in 0...(matrix.count-1) {
if (matrix[j][k] > height[k]) {
indexes.append([j,k])
height[k] = matrix[j][k]
}
}
}
//top
height = [Int](repeating: -1, count: matrix.count)
for j in (0...((matrix.count-1))).reversed() {
for k in (0...(matrix.count-1)) {
if (matrix[k][j] > height[k]) {
indexes.append([k, j])
height[k] = matrix[k][j]
}
}
}
//down
height = [Int](repeating: -1, count: matrix.count)
for j in (0...(matrix.count-1)) {
for k in (0...(matrix.count-1)) {
if (matrix[k][j] > height[k]) {
indexes.append([k, j])
height[k] = matrix[k][j]
}
}
}
let unique = Array(Set(indexes))
print(unique)
print(unique.count)