-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathindex.test.ts
72 lines (65 loc) · 1.42 KB
/
index.test.ts
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
70
71
72
import * as asserts from "https://deno.land/std@0.125.0/testing/asserts.ts";
import * as log from "https://deno.land/std@0.125.0/log/mod.ts";
import { arrayPairSum } from "./index.ts";
log.info("561. Array Partition I");
Deno.test({
name: `
Input: [1,4,3,2]
Output: 4
Explanation: n is 2, and the maximum sum of pairs is 4 = min(1, 2) + min(3, 4).
`,
fn(): void {
const result: number = arrayPairSum([1, 4, 3, 2]);
asserts.assertEquals(4, result);
},
});
Deno.test({
name: `
Input: [0, 1000, 999, 1]
Output: 999
`,
fn(): void {
const result: number = arrayPairSum([0, 1000, 999, 1]);
asserts.assertEquals(999, result);
},
});
Deno.test({
name: `
Input: [0, 0]
Output: 0
`,
fn(): void {
const result: number = arrayPairSum([0, 0]);
asserts.assertEquals(0, result);
},
});
Deno.test({
name: `
Input: [1, 10]
Output: 1
`,
fn(): void {
const result: number = arrayPairSum([1, 10]);
asserts.assertEquals(1, result);
},
});
Deno.test({
name: `
Input: [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
Output: 25
`,
fn(): void {
const result: number = arrayPairSum([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
asserts.assertEquals(25, result);
},
});
Deno.test({
name: `
Input: [1, 24, 18, 27, 6, 12, 15, 9, 3, 21]
Output: 61
`,
fn(): void {
const result: number = arrayPairSum([1, 24, 18, 27, 6, 12, 15, 9, 3, 21]);
asserts.assertEquals(61, result);
},
});