algorithm-demo/DataStructure/LinkedNode/test.spec.ts at master · snayan/algorithm-demo · GitHub

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
73
74
75
76
77
78
79
80
81
82
83
84
85
import { generateLinkedList, generateCycleLinkedList } from '.'

describe('测试生成单向链表', () => {
  it('对于给定空字符串', () => {
    let s = '';
    let head = generateLinkedList(s);
    expect(head).toBeNull();
  });
  it('对于给定一个字符的字符串', () => {
    let s = '1';
    let head = generateLinkedList(s);
    expect(head.val).toBe(s);
    expect(head.next).toBeNull();
  });
  it('对于给定多个字符的字符串', () => {
    let s = '123';
    let head = generateLinkedList(s);
    for (let v of s) {
      expect(head.val).toBe(v);
      head = head.next;
    }
    expect(head).toBeNull();
  });
  it('对于给定空数组', () => {
    let s = [];
    let head = generateLinkedList(s);
    expect(head).toBeNull();
  });
  it('对于给定非空数组', () => {
    let count = 1000;
    let s = [];
    for (let i = 0; i < count; i++) {
      s.push(i);
    }
    let head = generateLinkedList(s);
    for (let v of s) {
      expect(head.val).toBe(v);
      head = head.next;
    }
    expect(head).toBeNull();
  })
});

describe('测试生成循环链表', () => {
  it('对于给定空字符串', () => {
    let s = '';
    let head = generateCycleLinkedList(s);
    expect(head).toBeNull();
  });
  it('对于给定一个字符的字符串', () => {
    let s = '1';
    let head = generateCycleLinkedList(s);
    expect(head.val).toBe(s);
    expect(head.next).toBeNull();
  });
  it('对于给定多个字符的字符串', () => {
    let s = '123';
    let head = generateCycleLinkedList(s);
    let p = head;
    for (let v of s) {
      expect(p.val).toBe(v);
      p = p.next;
    }
    expect(p).toBe(head);
  });
  it('对于给定空数组', () => {
    let s = [];
    let head = generateCycleLinkedList(s);
    expect(head).toBeNull();
  });
  it('对于给定非空数组', () => {
    let count = 1000;
    let s = [];
    for (let i = 0; i < count; i++) {
      s.push(i);
    }
    let head = generateCycleLinkedList(s);
    let p = head;
    for (let v of s) {
      expect(p.val).toBe(v);
      p = p.next;
    }
    expect(p).toBe(head);
  })
})