add 9 solutions

RexWzh · RexWzh · commit 85a8cf4cf627 · 2022-03-15T12:18:27.000+08:00
106 169 233 297 504 507 599 798 946
diff --git a/src/problems/106.construct-binary-tree-from-inorder-and-postorder-traversal.jl b/src/problems/106.construct-binary-tree-from-inorder-and-postorder-traversal.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 106. Construct Binary Tree from Inorder and Postorder Traversal
 # id: problem106
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-02
 # difficulty: Medium
 # categories: Array, Tree, Depth-first Search
 # link: <https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/description/>
@@ -36,5 +36,19 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+function build_tree_inpost(inorder::AbstractArray, postorder::AbstractArray)::TreeNode
+    root = TreeNode(last(postorder))
+    pos = findfirst(==(root.val), inorder)
+    pos != 1 && (
+        root.left = build_tree_inpost(
+            @view(inorder[1:(pos - 1)]), @view(postorder[1:(pos - 1)])
+        )
+    )
+    pos != length(postorder) && (
+        root.right = build_tree_inpost(
+            @view(inorder[(pos + 1):end]), @view(postorder[pos:(end - 1)])
+        )
+    )
+    return root
+end
 ## @lc code=end
diff --git a/src/problems/169.majority-element.jl b/src/problems/169.majority-element.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 169. Majority Element
 # id: problem169
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-10
 # difficulty: Easy
 # categories: Array, Divide and Conquer, Bit Manipulation
 # link: <https://leetcode.com/problems/majority-element/description/>
@@ -34,5 +34,16 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+function majority_element(nums::Vector{Int})::Int
+    res = vote = 0
+    for num in nums
+        if vote == 0
+            vote += 1
+            res = num
+        else
+            vote += (res == num) ? 1 : -1
+        end
+    end
+    return res
+end
 ## @lc code=end
diff --git a/src/problems/233.number-of-digit-one.jl b/src/problems/233.number-of-digit-one.jl
@@ -0,0 +1,47 @@
+# ---
+# title: 233. Number of Digit One
+# id: problem233
+# author: zhwang
+# date: 2022-03-12
+# difficulty: Hard
+# categories: Math
+# link: <https://leetcode.com/problems/number-of-digit-one/description/>
+# hidden: true
+# ---
+# 
+# Given an integer n, count the total number of digit 1 appearing in all non-
+# negative integers less than or equal to n.
+# 
+# **Example:**
+# 
+#     
+#     
+#     Input: 13
+#     Output: 6 
+#     Explanation: Digit 1 occurred in the following numbers: 1, 10, 11, 12, 13.
+#     
+# 
+# 
+## @lc code=start
+using LeetCode
+
+function count_digit_one(n::Int)::Int
+    nums = reverse!([parse(Int, i) for i in string(n + 1)])
+    res, ones = 0, count(==(1), nums)
+    for (i, num) in enumerate(nums)
+        num == 1 && (ones -= 1)
+        res += 10^(i - 1) * (num * ones + (num > 1))
+        res += i > 1 && (10^(i - 2) * (i - 1) * num)
+    end
+    return res
+end
+
+## example: reduce 21413 to 0
+## num: step => reduced num
+## 2141|4|-1: 4*2*1 + 4*0 + (4>1)*10 => 21410-1
+## 214|1|0-1: 1*1*10 + 1*1*1 + (1>1)*10 => 21400-1
+## 21|4|00-1: 4*1*100 + 4*2*10 + (4>1)*100 => 21000-1
+## 2|1|000-1: 1*0*1000 + 1*3*100 + (1>1)*1000 => 20000-1
+## |2|0000-1: 2*0*10000 + 2*4*10000 + (2>1)*10000 => 0
+
+## @lc code=end
diff --git a/src/problems/297.serialize-and-deserialize-binary-tree.jl b/src/problems/297.serialize-and-deserialize-binary-tree.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 297. Serialize and Deserialize Binary Tree
 # id: problem297
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-11
 # difficulty: Hard
 # categories: Tree, Design
 # link: <https://leetcode.com/problems/serialize-and-deserialize-binary-tree/description/>
@@ -71,5 +71,46 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+serialize(::Nothing) = "[]"
+function serialize(root::TreeNode{Int})::String
+    res, queue, hasnew = String[], Union{TreeNode,Nothing}[root], true
+    while hasnew
+        hasnew = false
+        for _ in 1:length(queue)
+            node = popfirst!(queue)
+            if !isnothing(node)
+                push!(res, string(node.val))
+                push!(queue, node.left)
+                push!(queue, node.right)
+                all(isnothing.([node.left, node.right])) || (hasnew = true)
+            else
+                push!(res, "null")
+            end
+        end
+    end
+    return "[" * join(res, ',') * "]"
+end
+
+function deserialize(data::String)::Union{TreeNode,Nothing}
+    data == "[]" && return nothing
+    vals = split(data[2:(end - 1)], ',')
+    root, n = TreeNode(parse(Int, vals[1])), length(vals)
+    queue, m = [root], 2
+    while m <= n
+        for _ in 1:length(queue) # new nodes
+            node = popfirst!(queue)
+            if vals[m] != "null"
+                node.left = TreeNode(parse(Int, vals[m]))
+                push!(queue, node.left)
+            end
+            if vals[m + 1] != "null"
+                node.right = TreeNode(parse(Int, vals[m + 1]))
+                push!(queue, node.right)
+            end
+            m += 2
+        end
+    end
+    return root
+end
+
 ## @lc code=end
diff --git a/src/problems/504.base-7.jl b/src/problems/504.base-7.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 504. Base 7
 # id: problem504
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-10
 # difficulty: Easy
 # categories: 
 # link: <https://leetcode.com/problems/base-7/description/>
@@ -33,5 +33,17 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+function convert_to_base7(num::Int)::String
+    num == 0 && return "0"
+    sign = num < 0 ? -1 : 1
+    num *= sign
+    res = Int[]
+    while num > 0
+        push!(res, num % 7)
+        num ÷= 7
+    end
+    reverse!(res)
+    return sign != -1 ? join(res) : "-" * join(res)
+end
+
 ## @lc code=end
diff --git a/src/problems/507.perfect-number.jl b/src/problems/507.perfect-number.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 507. Perfect Number
 # id: problem507
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-10
 # difficulty: Easy
 # categories: Math
 # link: <https://leetcode.com/problems/perfect-number/description/>
@@ -71,5 +71,6 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+perfect_number(num::Int) = num in [6, 28, 496, 8128, 33550336]
+
 ## @lc code=end
diff --git a/src/problems/599.minimum-index-sum-of-two-lists.jl b/src/problems/599.minimum-index-sum-of-two-lists.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 599. Minimum Index Sum of Two Lists
 # id: problem599
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-14
 # difficulty: Easy
 # categories: Hash Table
 # link: <https://leetcode.com/problems/minimum-index-sum-of-two-lists/description/>
@@ -74,5 +74,19 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+function find_restaurant(list1::Vector{String}, list2::Vector{String})::Vector{String}
+    dic = Dict(st => (i - 1) for (i, st) in enumerate(list1))
+    cost, res = typemax(1), String[]
+    for (i, s) in enumerate(list2)
+        !haskey(dic, s) && continue
+        newcost = i - 1 + dic[s]
+        if newcost < cost
+            cost, res = newcost, [s]
+        elseif newcost == cost
+            push!(res, s)
+        end
+    end
+    return res
+end
+
 ## @lc code=end
diff --git a/src/problems/798.smallest-rotation-with-highest-score.jl b/src/problems/798.smallest-rotation-with-highest-score.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 798. Smallest Rotation with Highest Score
 # id: problem798
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-10
 # difficulty: Hard
 # categories: 
 # link: <https://leetcode.com/problems/smallest-rotation-with-highest-score/description/>
@@ -58,5 +58,20 @@
 ## @lc code=start
 using LeetCode
 
-## add your code here:
+function best_rotation(nums::Vector{Int})::Int
+    n = length(nums)
+    diffs = fill(0, n)
+    for (i, num) in enumerate(nums)
+        diffs[mod(i - num - 1, n) + 1] -= 1
+        diffs[i] += 1
+    end
+    ans = maxscore = score = 0
+    for (i, num) in enumerate(@view(diffs[1:(end - 1)]))
+        score += num
+        if score > maxscore
+            maxscore, ans = score, i
+        end
+    end
+    return ans
+end
 ## @lc code=end
diff --git a/src/problems/946.validate-stack-sequences.jl b/src/problems/946.validate-stack-sequences.jl
@@ -1,8 +1,8 @@
 # ---
 # title: 946. Validate Stack Sequences
 # id: problem946
-# author: Tian Jun
-# date: 2020-10-31
+# author: zhwang
+# date: 2022-03-11
 # difficulty: Medium
 # categories: Stack
 # link: <https://leetcode.com/problems/validate-stack-sequences/description/>
@@ -47,6 +47,19 @@
 # 
 ## @lc code=start
 using LeetCode
+function validate_stack_sequences(pushed::Vector{Int}, popped::Vector{Int})
+    return validate_stack_sequences!(copy(pushed), popped)
+end
+function validate_stack_sequences!(pushed::Vector{Int}, popped::Vector{Int})::Bool
+    stack = Int[]
+    for num in popped
+        while isempty(stack) || last(stack) != num
+            isempty(pushed) && return false
+            push!(stack, popfirst!(pushed))
+        end
+        pop!(stack)
+    end
+    return true
+end
 
-## add your code here:
 ## @lc code=end
diff --git a/src/unresolved/233.number-of-digit-one.jl b/src/unresolved/233.number-of-digit-one.jl
diff --git a/test/problems/106.construct-binary-tree-from-inorder-and-postorder-traversal.jl b/test/problems/106.construct-binary-tree-from-inorder-and-postorder-traversal.jl
@@ -0,0 +1,6 @@
+@testset "106.construct-binary-tree-from-inorder-and-postorder-traversal.jl" begin
+    inorder = [9, 3, 15, 20, 7]
+    postorder = [9, 15, 7, 20, 3]
+    tree = build_tree_inpost(inorder, postorder)
+    @test inorder_traversal(tree) == inorder && postorder_traversal(tree) == postorder
+end
diff --git a/test/problems/169.majority-element.jl b/test/problems/169.majority-element.jl
@@ -0,0 +1,4 @@
+@testset "169.majority-element.jl" begin
+    @test majority_element([3, 2, 3]) == 3
+    @test majority_element([2, 2, 1, 1, 1, 2, 2]) == 2
+end
diff --git a/test/problems/233.number-of-digit-one.jl b/test/problems/233.number-of-digit-one.jl
@@ -0,0 +1,8 @@
+@testset "233.number-of-digit-one.jl" begin
+    @test count_digit_one(0) == 0
+    @test all(count_digit_one(i) == 1 for i in 1:9)
+    @test count_digit_one(13) == 6
+    @test count_digit_one(999) == 300
+    @test count_digit_one(213789199) == 274085040
+    @test count_digit_one(100) == 21
+end
diff --git a/test/problems/297.serialize-and-deserialize-binary-tree.jl b/test/problems/297.serialize-and-deserialize-binary-tree.jl
@@ -0,0 +1,8 @@
+@testset "297.serialize-and-deserialize-binary-tree.jl" begin
+    root = TreeNode{Int}([1, 2, 3, nothing, nothing, 4, 5])
+    @test deserialize(serialize(root)) == root
+    @test deserialize(serialize(nothing)) === nothing
+    @test deserialize(serialize(TreeNode(1))) == TreeNode(1)
+    @test deserialize(serialize(TreeNode{Int}([1, 2]))) == TreeNode{Int}([1, 2])
+    @test deserialize(serialize(TreeNode{Int}([3, 2, 4, 3]))) == TreeNode{Int}([3, 2, 4, 3])
+end
diff --git a/test/problems/504.base-7.jl b/test/problems/504.base-7.jl
@@ -0,0 +1,5 @@
+@testset "504.base-7.jl" begin
+    @test convert_to_base7(100) == "202"
+    @test convert_to_base7(-7) == "-10"
+    @test convert_to_base7(0) == "0"
+end
diff --git a/test/problems/507.perfect-number.jl b/test/problems/507.perfect-number.jl
@@ -0,0 +1,4 @@
+@testset "507.perfect-number.jl" begin
+    @test perfect_number(28)
+    @test perfect_number(7) == false
+end
diff --git a/test/problems/599.minimum-index-sum-of-two-lists.jl b/test/problems/599.minimum-index-sum-of-two-lists.jl
@@ -0,0 +1,13 @@
+@testset "599.minimum-index-sum-of-two-lists.jl" begin
+    list1 = ["Shogun", "Tapioca Express", "Burger King", "KFC"]
+    list2 = ["Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"]
+    list3 = ["KFC", "Shogun", "Burger King"]
+    list4 = ["KFC", "Burger King", "Tapioca Express", "Shogun"]
+    list5 = ["KNN", "KFC", "Burger King", "Tapioca Express", "Shogun"]
+    @test find_restaurant(list1, list2) == ["Shogun"]
+    @test find_restaurant(list1, list3) == ["Shogun"]
+    @test find_restaurant(list1, list4) == list4
+    @test find_restaurant(list1, list5) ==
+        ["KFC", "Burger King", "Tapioca Express", "Shogun"]
+    @test find_restaurant(["KFC"], ["KFC"]) == ["KFC"]
+end
diff --git a/test/problems/798.smallest-rotation-with-highest-score.jl b/test/problems/798.smallest-rotation-with-highest-score.jl
diff --git a/test/problems/946.validate-stack-sequences.jl b/test/problems/946.validate-stack-sequences.jl
