Fix solutions for Codecov

Author: RexWzh

src/problems/1022.sum-of-root-to-leaf-binary-numbers.jl

@@ -79,7 +79,7 @@ end
 sum_root_to_leaf(root::TreeNode{Int}) = _sum_root_to_leaf(root)[1]
 
 ## BFS Algorithm
-sum_root_to_leaf_bfs(::Nothing) = 0
+## sum_root_to_leaf_bfs(::Nothing) = 0 # unnecessary
 function sum_root_to_leaf_bfs(root::TreeNode)
     queue, res = [(root.val, root)], 0
     while !isempty(queue)
@@ -88,9 +88,9 @@ function sum_root_to_leaf_bfs(root::TreeNode)
             if isnothing(node.left) && isnothing(node.right)
                 res += val
             else
-                val <<= 1
-                !isnothing(node.left) && push!(queue, (val + node.left.val, node.left))
-                !isnothing(node.right) && push!(queue, (val + node.right.val, node.right))
+                !isnothing(node.left) && push!(queue, (val << 1 + node.left.val, node.left))
+                !isnothing(node.right) &&
+                    push!(queue, (val << 1 + node.right.val, node.right))
             end
         end
     end

src/problems/486.predict-the-winner.jl

@@ -60,7 +60,7 @@ function is_ipv4(text::String)
     try
         all(0 <= parse(Int, x) <= 255 for x in data)
     catch
-        false
+        return false
     end
 end
 

src/problems/623.add-one-row-to-tree.jl

@@ -88,22 +88,23 @@ function add_one_row!(root::TreeNode, val::Int, depth::Int)
     if depth == 1
         node = TreeNode(val)
         node.left = root
-        return node
+        node
+    else
+        queue = [root]
+        for _ in 1:(depth - 2), _ in eachindex(queue)
+            node = popfirst!(queue)
+            isnothing(node.left) || (push!(queue, node.left))
+            isnothing(node.right) || (push!(queue, node.right))
+        end
+        for node in queue
+            left, right = node.left, node.right
+            node.left = TreeNode(val)
+            node.left.left = left
+            node.right = TreeNode(val)
+            node.right.right = right
+        end
+        root
     end
-    queue = [root]
-    for _ in 1:(depth-2), _ in eachindex(queue)
-        node = popfirst!(queue)
-        isnothing(node.left) || (push!(queue, node.left))
-        isnothing(node.right) || (push!(queue, node.right))
-    end
-    for node in queue
-        left, right = node.left, node.right
-        node.left = TreeNode(val)
-        node.left.left = left
-        node.right = TreeNode(val)
-        node.right.right = right
-    end
-    root
 end
 
-## @lc code=end
+## @lc code=end

src/problems/929.unique-email-addresses.jl

@@ -60,10 +60,11 @@ using LeetCode
 
 function actual_email(email)
     name, domain = split(email, '@')
-    name = first(split(replace(name, "."=>""), "+"))
+    name = first(split(replace(name, "." => ""), "+"))
     return name * "@" * domain
 end
 
-num_unique_emails(emails::Vector{String}) = length(unique(actual_email(email) for email in emails))
-
-## @lc code=end
+function num_unique_emails(emails::Vector{String})
+    return length(unique(actual_email(email) for email in emails))
+end
+## @lc code=end

test/problems/486.predict-the-winner.jl

@@ -1,6 +1,7 @@
 @testset "486.predict-the-winner.jl" begin
     @test valid_ip_address("172.16.254.1") == "IPv4"
     @test valid_ip_address("2001:0db8:85a3:0:0:8A2E:0370:7334") == "IPv6"
+    @test valid_ip_address("85a3.16.254.1") == "Neither"
     @test valid_ip_address("256.256.256.256") == "Neither"
     @test valid_ip_address("20EE:FGb8:85a3:0:0:8A2E:0370:7334") == "Neither"
 end

test/problems/623.add-one-row-to-tree.jl

@@ -1,10 +1,12 @@
 @testset "623.add-one-row-to-tree.jl" begin
     @test begin
-        root, val, depth = TreeNode{Int}([4,2,6,3,1,5]), 1, 2
-        add_one_row!(root, val, depth) == TreeNode{Int}([4,1,1,2,nothing,nothing,6,3,1,5])
+        root, val, depth = TreeNode{Int}([4, 2, 6, 3, 1, 5]), 1, 2
+        add_one_row!(root, val, depth) ==
+        TreeNode{Int}([4, 1, 1, 2, nothing, nothing, 6, 3, 1, 5])
     end
     @test begin
-        root, val, depth = TreeNode{Int}([4,2,nothing,3,1]), 1, 3
-        add_one_row!(root, val, depth) == TreeNode{Int}([4,2,nothing,1,1,3,nothing,nothing,1])
+        root, val, depth = TreeNode{Int}([4, 2, nothing, 3, 1]), 1, 3
+        add_one_row!(root, val, depth) ==
+        TreeNode{Int}([4, 2, nothing, 1, 1, 3, nothing, nothing, 1])
     end
-end
+end