-
Notifications
You must be signed in to change notification settings - Fork 109
/
ParenthesisCheckAlgorithm.kt
50 lines (40 loc) · 1.13 KB
/
ParenthesisCheckAlgorithm.kt
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
package other
/**
*
* Algorithm for checking a string for correct placement of parentheses using stack
*
* ([]) - correctly
* ()(){} - correctly
* (() - incorrectly
* (())[][]}{ - incorrectly
*
*/
class ParenthesisCheckAlgorithm {
fun check(code: String = DEFAULT_CODE): Boolean {
// we use a regular kotlin list to create a stack
val stack = mutableListOf<Char>()
var index = 0
while (index < code.length) {
when (val symbol = code[index]) {
'(', '{', '[' -> stack.add(symbol)
')', '}', ']' -> {
val value = bracketRelations[stack.removeLastOrNull()]
if (symbol != value) {
return false
}
}
}
index++
}
return stack.isEmpty()
}
companion object {
// the correct C program
private const val DEFAULT_CODE = """
void main() {
printf("Hello, World!");
}
"""
private val bracketRelations = mapOf('(' to ')', '{' to '}', '[' to ']')
}
}