LeetCode #392 Is Subsequence

LeetCode #392 Is Subsequence

문제 보기 : https://leetcode.com/problems/is-subsequence/submissions/

DP 문제를 많이 접해보지 못한 탓인지, 몇십분 끙끙거려도 풀지 못해 결국 geeksforgeeks 형의 힘을 빌렸다.

(알고리즘 초심자는, 무리하게 자기 힘으로 푸는 것보다는, 적극적으로 타인의 풀이를 참고하라고 했다.)

https://www.geeksforgeeks.org/given-two-strings-find-first-string-subsequence-second/

function solution(m, n) { if (m === 0) { return true; } if (n === 0) { return false; } if (s[m - 1] === t[n - 1]) { return solution(m - 1, n - 1); } else { return solution(m, n - 1); } } return solution(s.length, t.length);

Runtime: 72 ms, faster than 81.58% of JavaScript online submissions for Is Subsequence.

Memory Usage: 39.6 MB, less than 18.64% of JavaScript online submissions for Is Subsequence.

from http://6months.tistory.com/3 by ccl(A) rewrite - 2021-09-11 07:27:25