leetcode-583-Delete Operation for Two Strings

error:
cannot solve it.

pattern:

dp[i][j] = dp[i - 1][j - 1] + 1 (if s[i - 1] == p[j - 1])
dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) (if s[i - 1] != p[j - 1])

now cannot explain why dp[i][j] = dp[i - 1][j - 1] + 1 (if s[i - 1] == p[j - 1])