-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.go
More file actions
75 lines (66 loc) · 2.06 KB
/
main.go
File metadata and controls
75 lines (66 loc) · 2.06 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
// Source: https://leetcode.com/problems/count-ways-to-build-good-strings
// Title: Count Ways To Build Good Strings
// Difficulty: Medium
// Author: Mu Yang <http://muyang.pro>
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Given the integers `zero`, `one`, `low`, and `high`, we can construct a string by starting with an empty string, and then at each step perform either of the following:
//
// - Append the character `'0'` `zero` times.
// - Append the character `'1'` `one` times.
//
// This can be performed any number of times.
//
// A **good** string is a string constructed by the above process having a **length** between `low` and `high` (**inclusive** ).
//
// Return the number of **different** good strings that can be constructed satisfying these properties. Since the answer can be large, return it **modulo** `10^9 + 7`.
//
// **Example 1:**
//
// ```
// Input: low = 3, high = 3, zero = 1, one = 1
// Output: 8
// Explanation:
// One possible valid good string is "011".
// It can be constructed as follows: "" -> "0" -> "01" -> "011".
// All binary strings from "000" to "111" are good strings in this example.
// ```
//
// **Example 2:**
//
// ```
// Input: low = 2, high = 3, zero = 1, one = 2
// Output: 5
// Explanation: The good strings are "00", "11", "000", "110", and "011".
// ```
//
// **Constraints:**
//
// - `1 <= low<= high<= 10^5`
// - `1 <= zero, one <= low`
//
////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
package main
import "fmt"
const modulo = int(1e9 + 7)
// DP[i] is the number of good strings with length = i
func countGoodStrings(low int, high int, zero int, one int) int {
dp := make([]int, high+1)
dp[0] = 1
for i := 1; i <= high; i++ {
if i >= one {
dp[i] += dp[i-one]
}
if i >= zero {
dp[i] += dp[i-zero]
}
dp[i] %= modulo
}
res := 0
for i := low; i <= high; i++ {
res += dp[i]
}
return res % modulo
}
func main() {
fmt.Println(countGoodStrings(2, 3, 1, 2))
}