Notice
Recent Posts
«   2023/10   »
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
Tags more
Archives
Today
Total
관리 메뉴

## [leetCode/JS] 1143. Longest Common Subsequence 본문

coding test/leetCode

### [leetCode/JS] 1143. Longest Common Subsequence

쭘봉 2022. 12. 15. 10:17

### 문제 설명

Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.

A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.

• For example, "ace" is a subsequence of "abcde".

A common subsequence of two strings is a subsequence that is common to both strings.

### 입출력 예

#### Example 1:

Input: text1 = "abcde", text2 = "ace"
Output: 3
Explanation: The longest common subsequence is "ace" and its length is 3.

#### Example 2:

Input: text1 = "abc", text2 = "abc"
Output: 3
Explanation: The longest common subsequence is "abc" and its length is 3.

#### Example 3:

Input: text1 = "abc", text2 = "def"
Output: 0
Explanation: There is no such common subsequence, so the result is 0.

### Constraints

• 1 <= text1.length, text2.length <= 1000
• text1 and text2 consist of only lowercase English characters.

## 내 솔루션

var longestCommonSubsequence = function(text1, text2) {
let matrix = Array(text1.length + 1).fill(0).map(x => Array(text2.length + 1).fill(0))
for(let i = 1; i < matrix.length; i++){
for(let j = 1; j < matrix.length; j++){
if(text1[i-1] === text2[j-1]){
matrix[i][j] = matrix[i-1][j-1] + 1;
} else {
matrix[i][j] = Math.max(matrix[i-1][j], matrix[i][j-1]);
}
}
}
return matrix[text1.length][text2.length];
};

## 감상평

• DP는 개념이긴한데, 2차원 배열을 만들어서 이전과 비교하는 방식은 처음이네!
• 어려운 문제는 참 많구만 어렵다 어려워
• 빠르긴 겁나 빠르네.

#### 'coding test > leetCode' 카테고리의 다른 글

[leetCode/JS] 150. Evaluate Reverse Polish Notation  (0) 2022.12.17 2022.12.16 2022.12.14 2022.12.14 2022.12.13