anthonycicc/exercism
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

Merge branch 'master' of git.anthonycicchetti.com:anthonycicc/exercism

Browse source
This commit is contained in:
Anthony Cicchetti 2020-03-05 17:38:58 -05:00
commit a91c332d29
3 changed files with 53 additions and 31 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

62
kotlin/bracket-push/src/main/kotlin/BracketPush.kt
View file

@ -1,32 +1,32 @@
class BracketPush { import java.util.Stack
companion object {
fun isValid(inpString: String): Boolean{ class BracketPush {
val stack = mutableListOf<Char>() companion object {
val realString = inpString.filter { fun isValid(inpString: String): Boolean{
(it == '{') or val stack = Stack<Char>()
(it == '[') or val realString = inpString.filter {
(it == '(') or (it == '{') or
(it == ')') or (it == '[') or
(it == ']') or (it == '(') or
(it == '}') } (it == ')') or
for (i in realString){ (it == ']') or
if ((i == '{') or (it == '}') }
(i == '[') or for (i in realString){
(i == '(')){ if ((i == '{') or (i == '[') or (i == '(')){
stack.add(0, i) stack.push(i)
} }
else { else {
val temp = if (stack.size == 0) {'a'} else {stack.removeAt(0)} val temp = if (stack.size == 0) {'a'} else {stack.pop()}
when (temp){ when (temp){
'(' -> if (i != ')') return false '(' -> if (i != ')') return false
'{' -> if (i != '}') return false '{' -> if (i != '}') return false
'[' -> if (i != ']') return false '[' -> if (i != ']') return false
else -> return false else -> return false
} }
} }
} }
return stack.isEmpty() return stack.isEmpty()
} }
} }
} }

1
kotlin/bracket-push/src/test/kotlin/BracketPushTest.kt
View file

@ -23,6 +23,7 @@ class BracketPushTest(val input: String, val expectedOutput: Boolean) {
arrayOf("([{])", false), arrayOf("([{])", false),
arrayOf("[({]})", false), arrayOf("[({]})", false),
arrayOf("(((185 + 223.85) * 15) - 543)/2", true), arrayOf("(((185 + 223.85) * 15) - 543)/2", true),
arrayOf("b(())[]", true),
arrayOf("\\\\left(\\\\begin{array}{cc} \\\\frac{1}{3} & x\\\\\\\\ \\\\mathrm{e}^{x} &... x^2 \\\\end{array}\\\\right)", true) arrayOf("\\\\left(\\\\begin{array}{cc} \\\\frac{1}{3} & x\\\\\\\\ \\\\mathrm{e}^{x} &... x^2 \\\\end{array}\\\\right)", true)
) )
} }

21
kotlin/change/notes.txt Normal file
View file

@ -0,0 +1,21 @@
Anthony Cicchetti
,
3 mins
,
Edited,
build up a group of "smallest required for x cost"
in this case, your map would look like
please hold
Anthony Cicchetti
,
Now
,
Edited,
cost | coins
1 | 1
2 | 1 + cost(1)
3 | 1 + cost(2) OR 3 (we pick 3)
4 | 1 + cost(3) OR 4 (we pick 4)
5 | 1 + cost(4) OR 3 + cost(2) OR 4 + cost(1) (we pick the last or the first)
6 | 1 + cost(5) OR 3 + cost(3) OR 4 + cost(2) (we pick 3 + cost(3), because that's fewer coins than the other options)