Skip to content

Commit fa725d5

Browse files
kimi0230kimi0230
committed
feat: 1195.Fizz-Buzz-Multithreaded
1 parent 33c7775 commit fa725d5

File tree

2 files changed

+94
-20
lines changed

2 files changed

+94
-20
lines changed

‎Leetcode/0238.Product-of-Array-Except-Self/README.md

Lines changed: 76 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ description: "0238.Product-of-Array-Except-Self"
1010
license: ""
1111
images: []
1212

13-
tags: [LeetCode, Go, Medium, Product of Array Except Self]
13+
tags: [LeetCode, Go, Medium, Product of Array Except Self, Array, Prefix Sum]
1414
categories: [LeetCode]
1515

1616
featuredImage: ""
@@ -61,14 +61,39 @@ seo:
6161
# [238. Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/description/)
6262

6363
## 題目
64+
Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
6465

66+
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
67+
68+
You must write an algorithm that runs in O(n) time and without using the division operation.
69+
70+
71+
72+
Example 1:
73+
74+
Input: nums = [1,2,3,4]
75+
Output: [24,12,8,6]
76+
Example 2:
77+
78+
Input: nums = [-1,1,0,-3,3]
79+
Output: [0,0,9,0,0]
80+
81+
82+
Constraints:
83+
84+
2 <= nums.length <= 105
85+
-30 <= nums[i] <= 30
86+
The product of any prefix or suffix of nums is guaranteed to fit in a 32-bit integer.
87+
88+
89+
Follow up: Can you solve the problem in O(1) extra space complexity? (The output array does not count as extra space for space complexity analysis.)
6590
## 題目大意
6691

6792

6893
## 解題思路
6994

7095
## Big O
71-
時間複雜 : ``
96+
時間複雜 : `O(n)`
7297
空間複雜 : ``
7398

7499
## 來源
@@ -79,11 +104,59 @@ seo:
79104
https://github.com/kimi0230/LeetcodeGolang/blob/master/Leetcode/0238.Product-of-Array-Except-Self/main.go
80105

81106
```go
107+
package productofarrayexceptself
108+
109+
// 時間複雜 O(), 空間複雜 O()
110+
func productExceptSelf(nums []int) []int {
111+
result, left, right := make([]int, len(nums)), make([]int, len(nums)), make([]int, len(nums))
112+
113+
// left 為左側所有的成績
114+
// 索引為'0' 的元素, 因為左側沒有元素,所以left[0]=1
115+
left[0] = 1
116+
for i := 1; i < len(nums); i++ {
117+
left[i] = left[i-1] * nums[i-1]
118+
}
119+
120+
right[len(nums)-1] = 1
121+
for i := len(nums) - 2; i >= 0; i-- {
122+
right[i] = right[i+1] * nums[i+1]
123+
}
124+
125+
for i := 0; i < len(nums); i++ {
126+
result[i] = left[i] * right[i]
127+
}
128+
return result
129+
}
130+
131+
func productExceptSelf2(nums []int) []int {
132+
result := make([]int, len(nums))
133+
134+
result[0] = 1
135+
for i := 1; i < len(nums); i++ {
136+
result[i] = result[i-1] * nums[i-1]
137+
}
138+
139+
rightProduct := 1
140+
for i := len(nums) - 1; i >= 0; i-- {
141+
result[i] = result[i] * rightProduct
142+
rightProduct = rightProduct * nums[i]
143+
}
144+
145+
return result
146+
}
82147

83148
```
84149

85150
## Benchmark
86151

87152
```sh
88-
153+
go test -benchmem -run=none LeetcodeGolang/Leetcode/0238.Product-of-Array-Except-Self -bench=.
154+
goos: darwin
155+
goarch: amd64
156+
pkg: LeetcodeGolang/Leetcode/0238.Product-of-Array-Except-Self
157+
cpu: Intel(R) Core(TM) i5-8259U CPU @ 2.30GHz
158+
BenchmarkProductExceptSelf-8 12772174 158.4 ns/op 96 B/op 3 allocs/op
159+
BenchmarkProductExceptSelf2-8 32292304 63.74 ns/op 32 B/op 1 allocs/op
160+
PASS
161+
ok LeetcodeGolang/Leetcode/0238.Product-of-Array-Except-Self 4.228s
89162
```

‎README.md

Lines changed: 18 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ https://kimi0230.github.io/LeetcodeGolang/
1111
- [leetcode Content](#leetcode-content)
1212
- [Data Structure](#data-structure)
1313
- [Array \& String](#array--string)
14-
- [| 0412 | 0412.Fizz Buzz | Go | Easy | O(n) | O(n) | Array, string |](#-0412---------------------------------------------------------------------0412fizz-buzz---------------------------------------------------go---------------------easy--------on-------------on------array-string---------)
14+
- [| 1195 | 1195.Fizz Buzz Multithreaded | Go | Medium | O(n) | | Array, string,Concurrency |](#-1195-----------------------------------------1195fizz-buzz-multithreaded------------------------------go--------------medium------on-------------------array-stringconcurrency-)
1515
- [Matrix](#matrix)
1616
- [Linked List](#linked-list)
1717
- [HashSet \& HashMap](#hashset--hashmap)
@@ -58,22 +58,23 @@ https://kimi0230.github.io/LeetcodeGolang/
5858

5959
#### Array & String
6060

61-
| No. | Title | Solution | Difficulty | Time | Space | Topic |
62-
|----------------------------------------------------------------------------------------------------------------|:-----------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------:|------------|---------------|--------|-----------------------|
63-
| [0001](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0001.Two-Sum) | [Two Sum](https://leetcode.com/problems/two-sum/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0001.Two-Sum) | Easy | O(n) | O(n) | Array |
64-
| [0003](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0003.Longest-Substring-Without-Repeating-Characters) | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0003.Longest-Substring-Without-Repeating-Characters) | Medium | O(n) | O(1) | Array, Sliding Window |
65-
| [0015](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0015.3Sum) | [3 Sum](https://leetcode.com/problems/3sum/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0015.3Sum) | Medium | O(n^2) | O(n) | Array |
66-
| [0027](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0027.Remove-Element) | [Remove Element](https://leetcode.com/problems/remove-element/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0027.Remove-Element) | Easy | O(n) | O(1) | Array |
67-
| [0035](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0035.Search-Insert-Position) | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0035.Search-Insert-Position) | Easy | O(n), O(logn) | O(1) | Array |
68-
| [0049](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0049.Group-Anagrams) | [Search Insert Position](https://leetcode.com/problems/group-anagrams/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0049.Group-Anagrams) | Medium | O(kn) | O(kn) | Array |
69-
| [0059](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0059.Spiral-Matrix-II) | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0059.Spiral-Matrix-II) | Medium | O(n) | O(n^2) | Array |
70-
| [0088](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0088.Merge-Sorted-Array) | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0088.Merge-Sorted-Array) | Easy | O(n) | O(1) | Array |
71-
| [0217](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0217.Contains-Duplicate) | [0217.Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0217.Contains-Duplicate) | Easy | O(n) | O(n) | Array |
72-
| [0242](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0242.Valid-Anagram) | [0242.Valid Anagram](https://leetcode.com/problems/valid-anagram/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0242.Valid-Anagram) | Easy | O(n) | O(n) | Array |
73-
| [0409](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0409.Longest-Palindrome) | [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0409.Longest-Palindrome) | Easy | O(n) | O(1) | Array |
74-
| [0380](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0380.Insert-Delete-GetRandom-O1) | [0380.Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0380.Insert-Delete-GetRandom-O1) | Medium | O(1) | O(n) | Array |
75-
| [0381](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0381.Insert-Delete-GetRandom-O1-Duplicates-allowed) | [0381.Insert Delete GetRandom O(1) Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0381.Insert-Delete-GetRandom-O1-Duplicates-allowed) | Medium | O(1) | O(n) | Array |
76-
| [0412](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0412.Fizz-Buzz) | [0412.Fizz Buzz](https://leetcode.com/problems/fizz-buzz/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0412.Fizz-Buzz) | Easy | O(n) | O(n) | Array, string |
61+
| No. | Title | Solution | Difficulty | Time | Space | Topic |
62+
|----------------------------------------------------------------------------------------------------------------|:-----------------------------------------------------------------------------------------------------------------------------------:|:-------------------------------------------------------------------------------------------------------------------------:|------------|---------------|--------|---------------------------|
63+
| [0001](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0001.Two-Sum) | [Two Sum](https://leetcode.com/problems/two-sum/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0001.Two-Sum) | Easy | O(n) | O(n) | Array |
64+
| [0003](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0003.Longest-Substring-Without-Repeating-Characters) | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0003.Longest-Substring-Without-Repeating-Characters) | Medium | O(n) | O(1) | Array, Sliding Window |
65+
| [0015](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0015.3Sum) | [3 Sum](https://leetcode.com/problems/3sum/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0015.3Sum) | Medium | O(n^2) | O(n) | Array |
66+
| [0027](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0027.Remove-Element) | [Remove Element](https://leetcode.com/problems/remove-element/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0027.Remove-Element) | Easy | O(n) | O(1) | Array |
67+
| [0035](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0035.Search-Insert-Position) | [Search Insert Position](https://leetcode.com/problems/search-insert-position/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0035.Search-Insert-Position) | Easy | O(n), O(logn) | O(1) | Array |
68+
| [0049](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0049.Group-Anagrams) | [Search Insert Position](https://leetcode.com/problems/group-anagrams/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0049.Group-Anagrams) | Medium | O(kn) | O(kn) | Array |
69+
| [0059](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0059.Spiral-Matrix-II) | [Spiral Matrix II](https://leetcode.com/problems/spiral-matrix-ii/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0059.Spiral-Matrix-II) | Medium | O(n) | O(n^2) | Array |
70+
| [0088](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0088.Merge-Sorted-Array) | [Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0088.Merge-Sorted-Array) | Easy | O(n) | O(1) | Array |
71+
| [0217](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0217.Contains-Duplicate) | [0217.Contains Duplicate](https://leetcode.com/problems/contains-duplicate/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0217.Contains-Duplicate) | Easy | O(n) | O(n) | Array |
72+
| [0242](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0242.Valid-Anagram) | [0242.Valid Anagram](https://leetcode.com/problems/valid-anagram/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0242.Valid-Anagram) | Easy | O(n) | O(n) | Array |
73+
| [0409](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0409.Longest-Palindrome) | [409. Longest Palindrome](https://leetcode.com/problems/longest-palindrome/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0409.Longest-Palindrome) | Easy | O(n) | O(1) | Array |
74+
| [0380](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0380.Insert-Delete-GetRandom-O1) | [0380.Insert Delete GetRandom O(1)](https://leetcode.com/problems/insert-delete-getrandom-o1/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0380.Insert-Delete-GetRandom-O1) | Medium | O(1) | O(n) | Array |
75+
| [0381](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0381.Insert-Delete-GetRandom-O1-Duplicates-allowed) | [0381.Insert Delete GetRandom O(1) Duplicates allowed](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0381.Insert-Delete-GetRandom-O1-Duplicates-allowed) | Medium | O(1) | O(n) | Array |
76+
| [0412](https://kimi0230.github.io/LeetcodeGolang/Leetcode/0412.Fizz-Buzz) | [0412.Fizz Buzz](https://leetcode.com/problems/fizz-buzz/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/0412.Fizz-Buzz) | Easy | O(n) | O(n) | Array, string |
77+
| [1195](https://kimi0230.github.io/LeetcodeGolang/Leetcode/1195.Fizz-Buzz-Multithreaded) | [1195.Fizz Buzz Multithreaded](https://leetcode.com/problems/fizz-buzz-multithreaded/description/) | [Go](https://github.com/kimi0230/LeetcodeGolang/tree/master/Leetcode/1195.Fizz-Buzz-Multithreaded) | Medium | O(n) | | Array, string,Concurrency |
7778
---
7879

7980
#### Matrix

0 commit comments

Comments
 (0)