Browse Source

Remove unnecessary parenthesis

content-update
Xavier Petit 4 years ago committed by xpetit
parent
commit
78839103c9
  1. 4
      tests/go/solutions/lcm/main.go
  2. 16
      tests/go/solutions/nauuo.go
  3. 16
      tests/go/solutions/nauuo/main.go
  4. 2
      tests/go/solutions/sametree.go
  5. 2
      tests/go/solutions/sametree/main.go
  6. 2
      tests/go/solutions/swapbits.go

4
tests/go/solutions/lcm/main.go

@ -10,13 +10,13 @@ import "fmt"
func gcd(first, second int) int {
if second == 0 {
return (first)
return first
}
return gcd(second, first%second)
}
func Lcm(first, second int) int {
return (first / gcd(first, second) * second)
return first / gcd(first, second) * second
}
func main() {
fmt.Println(Lcm(3, 0))

16
tests/go/solutions/nauuo.go

@ -10,26 +10,26 @@ package solutions
func Nauuo(plus, minus, rand int) string {
if rand == 0 {
if plus > minus {
return ("+")
return "+"
}
if plus < minus {
return ("-")
return "-"
}
if plus == minus {
return ("0")
return "0"
}
}
if plus > minus+rand {
return ("+")
return "+"
}
if plus+rand < minus {
return ("-")
return "-"
}
if (plus+rand >= minus) && (plus-rand <= minus) {
return ("?")
return "?"
}
if (minus+rand >= plus) && (minus-rand <= plus) {
return ("?")
return "?"
}
return ("?")
return "?"
}

16
tests/go/solutions/nauuo/main.go

@ -9,28 +9,28 @@ package main
func Nauuo(plus, minus, rand int) string {
if rand == 0 {
if plus > minus {
return ("+")
return "+"
}
if plus < minus {
return ("-")
return "-"
}
if plus == minus {
return ("0")
return "0"
}
}
if plus > minus+rand {
return ("+")
return "+"
}
if plus+rand < minus {
return ("-")
return "-"
}
if (plus+rand >= minus) && (plus-rand <= minus) {
return ("?")
return "?"
}
if (minus+rand >= plus) && (minus-rand <= plus) {
return ("?")
return "?"
}
return ("?")
return "?"
}
func main() {

2
tests/go/solutions/sametree.go

@ -23,5 +23,5 @@ func checkIfEq(t1 *TreeNodeL, t2 *TreeNodeL) bool {
if t1 == nil || t2 == nil {
return false
}
return (t1.Val == t2.Val && checkIfEq(t1.Right, t2.Right) && checkIfEq(t1.Left, t2.Left))
return t1.Val == t2.Val && checkIfEq(t1.Right, t2.Right) && checkIfEq(t1.Left, t2.Left)
}

2
tests/go/solutions/sametree/main.go

@ -23,7 +23,7 @@ func checkIfEq(t1 *TreeNodeL, t2 *TreeNodeL) bool {
if t1 == nil || t2 == nil {
return false
}
return (t1.Val == t2.Val && checkIfEq(t1.Right, t2.Right) && checkIfEq(t1.Left, t2.Left))
return t1.Val == t2.Val && checkIfEq(t1.Right, t2.Right) && checkIfEq(t1.Left, t2.Left)
}
func main() {

2
tests/go/solutions/swapbits.go

@ -1,5 +1,5 @@
package solutions
func SwapBits(n byte) byte {
return ((n >> 4) | (n << 4))
return (n >> 4) | (n << 4)
}

Loading…
Cancel
Save