From c7f5c03abc9a3f3f92798a0d70473746dda74718 Mon Sep 17 00:00:00 2001 From: Gonzalo Diaz Date: Wed, 11 Feb 2026 18:02:45 -0300 Subject: [PATCH] [BUGFIX] new finding: redundant and: i+1 <= len(dataTree)-1 && i+1 <= len(dataTree)-1 --- exercises/projecteuler/lib/BNodeBuilder.go | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) diff --git a/exercises/projecteuler/lib/BNodeBuilder.go b/exercises/projecteuler/lib/BNodeBuilder.go index 2a7cedc..6591ffd 100644 --- a/exercises/projecteuler/lib/BNodeBuilder.go +++ b/exercises/projecteuler/lib/BNodeBuilder.go @@ -12,8 +12,7 @@ func buildBNodeTreeRecursive( resultNode := BNode{dataTree[i][j], nil, nil} - if i+1 <= len(dataTree)-1 && j <= len(dataTree[i+1])-1 && - i+1 <= len(dataTree)-1 && j+1 <= len(dataTree[i+1])-1 { + if i+1 <= len(dataTree)-1 && j <= len(dataTree[i+1])-1 && j+1 <= len(dataTree[i+1])-1 { left, err := buildBNodeTreeRecursive(dataTree, i+1, j) log.Debug("left: %v | err: %t", left, err) @@ -48,7 +47,7 @@ func buildBNodeTreeWeigthRecursive( resultNode := BNode{dataTree[i][j] + rootValue.getValue(), nil, nil} if i+1 <= len(dataTree)-1 && j <= len(dataTree[i+1])-1 && - i+1 <= len(dataTree)-1 && j+1 <= len(dataTree[i+1])-1 { + j+1 <= len(dataTree[i+1])-1 { var left BNode var right BNode