leetcode-problems/problems/1480-running-sum-of-1d-array/solution.test.ts at main · SamehElalfi/leetcode-problems · 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
86
87
88
import { describe, it } from 'node:test';
import assert from 'node:assert';
import { runningSum, runningSumNonDestructive } from './solution';

describe('LeetCode 1480 - Running Sum of 1d Array', () => {
  describe('runningSum (In-Place)', () => {
    it('should return [1,3,6,10] for input [1,2,3,4]', () => {
      const nums = [1, 2, 3, 4];
      const result = runningSum(nums);
      assert.deepStrictEqual(result, [1, 3, 6, 10]);
    });

    it('should return [1,2,3,4,5] for input [1,1,1,1,1]', () => {
      const nums = [1, 1, 1, 1, 1];
      const result = runningSum(nums);
      assert.deepStrictEqual(result, [1, 2, 3, 4, 5]);
    });

    it('should return [3,4,6,16,17] for input [3,1,2,10,1]', () => {
      const nums = [3, 1, 2, 10, 1];
      const result = runningSum(nums);
      assert.deepStrictEqual(result, [3, 4, 6, 16, 17]);
    });

    it('should handle single element array', () => {
      const nums = [5];
      const result = runningSum(nums);
      assert.deepStrictEqual(result, [5]);
    });

    it('should handle array with negative numbers', () => {
      const nums = [1, -2, 3, -4];
      const result = runningSum(nums);
      assert.deepStrictEqual(result, [1, -1, 2, -2]);
    });

    it('should return empty array for empty input', () => {
      const nums: number[] = [];
      const result = runningSum(nums);
      assert.deepStrictEqual(result, []);
    });
  });

  describe('runningSumNonDestructive (New Array)', () => {
    it('should return [1,3,6,10] for input [1,2,3,4]', () => {
      const nums = [1, 2, 3, 4];
      const result = runningSumNonDestructive(nums);
      assert.deepStrictEqual(result, [1, 3, 6, 10]);
    });

    it('should return [1,2,3,4,5] for input [1,1,1,1,1]', () => {
      const nums = [1, 1, 1, 1, 1];
      const result = runningSumNonDestructive(nums);
      assert.deepStrictEqual(result, [1, 2, 3, 4, 5]);
    });

    it('should return [3,4,6,16,17] for input [3,1,2,10,1]', () => {
      const nums = [3, 1, 2, 10, 1];
      const result = runningSumNonDestructive(nums);
      assert.deepStrictEqual(result, [3, 4, 6, 16, 17]);
    });

    it('should not modify the original array', () => {
      const nums = [1, 2, 3, 4];
      const originalNums = [...nums];
      runningSumNonDestructive(nums);
      assert.deepStrictEqual(nums, originalNums);
    });

    it('should handle single element array', () => {
      const nums = [5];
      const result = runningSumNonDestructive(nums);
      assert.deepStrictEqual(result, [5]);
    });

    it('should handle array with negative numbers', () => {
      const nums = [1, -2, 3, -4];
      const result = runningSumNonDestructive(nums);
      assert.deepStrictEqual(result, [1, -1, 2, -2]);
    });

    it('should return empty array for empty input', () => {
      const nums: number[] = [];
      const result = runningSumNonDestructive(nums);
      assert.deepStrictEqual(result, []);
    });
  });
});