leetcode-ts/leetcode/0032.longest-valid-parentheses/index.test.ts at master · guocaoyi/leetcode-ts · GitHub

Name: leetcode-ts/leetcode/0032.longest-valid-parentheses/index.test.ts at master · guocaoyi/leetcode-ts · GitHub
Rating: 4.7 (4528 reviews)
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
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
import*asassertsfrom"https://deno.land/std@0.125.0/testing/asserts.ts";
import*aslogfrom"https://deno.land/std@0.125.0/log/mod.ts";
import{longestValidParentheses}from"./index.ts";

log.info("32. Longest Valid Parentheses");

Deno.test({
name: `
 Input: "(()"
 Output: 2
 Explanation: The longest valid parentheses substring is "()"
 `,
fn(): void{
constresult: number=longestValidParentheses("(()");
asserts.assertEquals(2,result);
},
});

Deno.test({
name: `
 Input: ")()())"
 Output: 4
 Explanation: The longest valid parentheses substring is "()()"
 `,
fn(): void{
constresult: number=longestValidParentheses(")()())");
asserts.assertEquals(4,result);
},
});

Deno.test({
name: `
 Input: "))))))))(((((((("
 Output: 0
 Explanation: The longest valid parentheses substring is ""
 `,
fn(): void{
constresult: number=longestValidParentheses("))))))))((((((((");
asserts.assertEquals(0,result);
},
});

Deno.test({
name: `
 Input: "()((((((((((()()()))))))))))"
 Output: 28
 Explanation: The longest valid parentheses substring is "()((((((((((()()()))))))))))"
 `,
fn(): void{
constresult: number=longestValidParentheses(
"()((((((((((()()()))))))))))",
);
asserts.assertEquals(28,result);
},
});

Deno.test({
name: `
 Input: "()(((((((((((())()())))))))))))))))))))))()((((((((((()()()))))))))))"
 Output: 30
 Explanation: The longest valid parentheses substring is "()(((((((((((())()()))))))))))"
 `,
fn(): void{
constresult: number=longestValidParentheses(
"()(((((((((((())()())))))))))))))))))))))()((((((((((()()()))))))))))",
);
asserts.assertEquals(30,result);
},
});