Skip to content

[REFACTOR] sonarcloud warnings (Consistency) fixed. #316

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Mar 19, 2025
Merged

[REFACTOR] sonarcloud warnings (Consistency) fixed. #316

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 6 additions & 6 deletions exercises/projecteuler/lib/BNodeBuilder.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -42,7 +42,7 @@ func buildBNodeTreeWeigthRecursive(
j int,
rootValue BNode,
leafCollector []int,
) (result BNode, leafs []int, err bool) {
) (result BNode, leaves []int, err bool) {
if 0 <= i && i < len(dataTree) && 0 <= j && j < len(dataTree[i]) {

resultNode := BNode{dataTree[i][j] + rootValue.getValue(), nil, nil}
Expand All @@ -55,12 +55,12 @@ func buildBNodeTreeWeigthRecursive(
var err bool

left, leafCollector, err = buildBNodeTreeWeigthRecursive(dataTree, i+1, j, resultNode, leafCollector)
utils.Debug("left: %v | err: %t | leafsCarry: %v", left, err, leafCollector)
utils.Debug("left: %v | err: %t | leavesCarry: %v", left, err, leafCollector)

resultNode.setLeft(left)

right, leafCollector, err = buildBNodeTreeWeigthRecursive(dataTree, i+1, j+1, resultNode, leafCollector)
utils.Debug("right: %v | err: %t | leafsCarry: %v", left, err, leafCollector)
utils.Debug("right: %v | err: %t | leavesCarry: %v", left, err, leafCollector)

resultNode.setRight(right)

Expand All @@ -76,10 +76,10 @@ func buildBNodeTreeWeigthRecursive(
}

func BuildBNodeTreeWeigth(dataTree [][]int) (result Tree, err bool) {
leafs := []int{}
leaves := []int{}
root := BNode{0, nil, nil}

_root, _leafs, err := buildBNodeTreeWeigthRecursive(dataTree, 0, 0, root, leafs)
newRoot, newLeaves, err := buildBNodeTreeWeigthRecursive(dataTree, 0, 0, root, leaves)

return Tree{_root, _leafs}, err
return Tree{newRoot, newLeaves}, err
}