115. Distinct Subsequences

2023-03-05

115. Distinct Subsequences Description Given a string S and a string T, count the number of distinct subsequences of S which equals T.

Read more

LeetCode - 1187. Make Array Strictly Increasing

2023-03-05

1187. Make Array Strictly Increasing Description Given two integer arrays arr1 and arr2, return the minimum number of operations (possibly zero) needed to make arr1 strictly increasing. In one operation, you can choose two indices 0 <= i < arr1.length and 0 <= j < arr2.length and do the assignment arr1[i] = arr2[j]. If there is no way to make a..

Read more

Hello World

2023-03-05

Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub.

Read more

1234