Typo of problem 1955.

[ThreeMonth03]

leetcode/solution/1900-1999/1955.Count Number of Special Subsequences/README.md

Lines 95 to 102 in 6c6cb55

	$$
	\begin{aligned}
	f[i][0] &= 2 \times f[i - 1][0] + 1, \quad nums[i] = 0 \\
	f[i][1] &= f[i-1][1] + 2 \times f[i - 1][0], \quad nums[i] = 1 \\
	f[i][2] &= f[i-1][2] + 2 \times f[i - 1][1], \quad nums[i] = 2 \\
	f[i][j] &= f[i-1][j], \quad nums[i] \neq j
	\end{aligned}
	$$

It should be

 $$ 
 \begin{aligned} 
 f[i][0] &= 2 \times f[i - 1][0] + 1, \quad nums[i] = 0 \\ 
 f[i][1] &= f[i-1][0] + 2 \times f[i - 1][1], \quad nums[i] = 1 \\ 
 f[i][2] &= f[i-1][1] + 2 \times f[i - 1][2], \quad nums[i] = 2 \\ 
 f[i][j] &= f[i-1][j], \quad nums[i] \neq j 
 \end{aligned} 
 $$ 

[yanglbme]

Thanks for the feedback! We've fixed this issue in PR #4257.