Solution to 1018

Author: Indigo2233

src/unresolved/1018.binary-prefix-divisible-by-5.jl renamed to src/problems/1018.binary-prefix-divisible-by-5.jl

@@ -1,8 +1,8 @@
 # ---
 # title: 1018. Binary Prefix Divisible By 5
 # id: problem1018
-# author: Tian Jun
-# date: 2020-10-31
+# author: Indigo
+# date: 2022-03-19
 # difficulty: Easy
 # categories: Array
 # link: <https://leetcode.com/problems/binary-prefix-divisible-by-5/description/>
@@ -61,5 +61,14 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+function prefixes_div_by5(nums::Vector{Int})
+    len = length(nums)
+    res = fill(false, len)    
+    cur = 0
+    for i in 1:len
+        cur = cur * 2 + nums[i]
+        cur % 5 == 0 && (res[i] = true)
+    end
+    res
+end
 ## @lc code=end

src/problems/1110.delete-nodes-and-return-forest.jl

@@ -58,15 +58,17 @@ function del_nodes1110(node::TreeNode{Int}, to_delete::Vector{Int})
         for child in (:left, :right)
             isnothing(getproperty(root, child)) && continue
             if getproperty(root, child).val ∈ to_deletes
-                !isnothing(getproperty(root, child).left) && push!(queue, (getproperty(root, child).left, true))
-                !isnothing(getproperty(root, child).right) && push!(queue, (getproperty(root, child).right, true))
+                !isnothing(getproperty(root, child).left) &&
+                    push!(queue, (getproperty(root, child).left, true))
+                !isnothing(getproperty(root, child).right) &&
+                    push!(queue, (getproperty(root, child).right, true))
                 setproperty!(root, child, nothing)
             else
                 push!(queue, (getproperty(root, child), false))
             end
         end
         flg && push!(res, root)
     end
-    res
+    return res
 end
 ## @lc code=end

test/problems/1018.binary-prefix-divisible-by-5.jl

@@ -0,0 +1,6 @@
+@testset "1018.binary-prefix-divisible-by-5.jl" begin
+    @test prefixes_div_by5([0, 1, 1]) == [true, false, false]
+    @test prefixes_div_by5([1, 1, 1]) == [false, false, false]
+    @test prefixes_div_by5([0, 1, 1, 1, 1, 1]) == [true, false, false, false, true, false]
+    @test prefixes_div_by5([1, 1, 1, 0, 1]) == [false, false, false, false, false]
+end

test/problems/1110.delete-nodes-and-return-forest.jl

@@ -1,3 +1,4 @@
 @testset "1110.delete-nodes-and-return-forest.jl" begin
-    @test del_nodes1110(TreeNode{Int}([1, 2, 3, 4, 5, 6, 7]), [3, 5]) == [TreeNode{Int}([1, 2, nothing, 4]), TreeNode(6), TreeNode(7)]
+    @test del_nodes1110(TreeNode{Int}([1, 2, 3, 4, 5, 6, 7]), [3, 5]) ==
+          [TreeNode{Int}([1, 2, nothing, 4]), TreeNode(6), TreeNode(7)]
 end