chore: configure alias

Author: oushihao

jest.config.js

@@ -3,5 +3,8 @@ module.exports = {
   coverageDirectory: 'coverage',
   preset: 'ts-jest',
   testEnvironment: 'node',
-  testRegex: '(/__tests__/.*|(\\.|/)(test|spec))\\.tsx?$'
+  testRegex: '(/__tests__/.*|(\\.|/)(test|spec))\\.tsx?$',
+  moduleNameMapper: {
+    '~/(.*?)$': '<rootDir>/$1'
+  }
 };

problemset/add-two-numbers/index.spec.ts

@@ -1,5 +1,5 @@
 import { addTwoNumbers } from './index';
-import { ListNode, createListNode } from '../../utils/listNode';
+import { ListNode, createListNode } from '~/utils/listNode';
 
 describe('两数相加', () => {
   describe('模拟', () => {

problemset/add-two-numbers/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * @desc 时间复杂度：O(max(m,n))  空间复杂度 O(1)

problemset/balanced-binary-tree/index.spec.ts

@@ -1,5 +1,5 @@
 import { isBalanced } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('平衡二叉树', () => {
   testCase(isBalanced);

problemset/balanced-binary-tree/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 自顶向下的递归

problemset/binary-search-tree-iterator/index.spec.ts

@@ -1,5 +1,5 @@
 import { BSTIterator } from '.';
-import { createTreeNode } from '../../utils/treeNode';
+import { createTreeNode } from '~/utils/treeNode';
 
 it('二叉搜索树迭代器', () => {
   const bst = new BSTIterator(createTreeNode([7, 3, 15, null, null, 9, 20]));

problemset/binary-search-tree-iterator/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/binary-tree-inorder-traversal/index.spec.ts

@@ -1,4 +1,4 @@
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 import {
   inorderTraversal,
   inorderTraversal2,

problemset/binary-tree-inorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/binary-tree-level-order-traversal-2/index.spec.ts

@@ -1,5 +1,5 @@
 import { levelOrderBottom } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('二叉树的层序遍历 II', () => {
   testCase(levelOrderBottom);

problemset/binary-tree-level-order-traversal-2/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 广度优先搜索

problemset/binary-tree-level-order-traversal/index.spec.ts

@@ -1,5 +1,5 @@
 import { levelOrder } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('二叉树的层序遍历', () => {
   testCase(levelOrder);

problemset/binary-tree-level-order-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 迭代 - 广度优先查找

problemset/binary-tree-maximum-path-sum/index.spec.ts

@@ -1,5 +1,5 @@
 import { maxPathSum } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('二叉树中的最大路径和', () => {
   testCase(maxPathSum);

problemset/binary-tree-maximum-path-sum/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/binary-tree-postorder-traversal/index.spec.ts

@@ -1,4 +1,4 @@
-import { createTreeNode, TreeNode } from '../../utils/treeNode';
+import { createTreeNode, TreeNode } from '~/utils/treeNode';
 import {
   postorderTraversal,
   postorderTraversal2,

problemset/binary-tree-postorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/binary-tree-preorder-traversal/index.spec.ts

@@ -1,4 +1,4 @@
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 import {
   preorderTraversal,
   preorderTraversal2,

problemset/binary-tree-preorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/binary-tree-zigzag-level-order-traversal/index.spec.ts

@@ -1,4 +1,4 @@
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 import { zigzagLevelOrder } from './index';
 
 describe('二叉树的锯齿形层序遍历', () => {

problemset/binary-tree-zigzag-level-order-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 广度优先遍历

problemset/clone-graph/index.spec.ts

@@ -1,4 +1,4 @@
-import { Node, createGraph } from '../../utils/graph';
+import { Node, createGraph } from '~/utils/graph';
 import { cloneGraph, cloneGraph2 } from './index';
 
 describe('克隆图', () => {

problemset/clone-graph/index.ts

@@ -1,4 +1,4 @@
-import { Node } from '../../utils/graph';
+import { Node } from '~/utils/graph';
 
 /**
  * 深度优先搜索

problemset/combinations/index.spec.ts

@@ -1,4 +1,4 @@
-import { twoDimensionalArrayEqual } from '../../utils/tools';
+import { twoDimensionalArrayEqual } from '~/utils/tools';
 import { combine } from './index';
 
 describe('组合', () => {

problemset/construct-binary-tree-from-inorder-and-postorder-traversal/index.spec.ts

@@ -1,5 +1,5 @@
 import { buildTree, buildTree2 } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('从中序与后序遍历序列构造二叉树', () => {
   describe('递归', () => {

problemset/construct-binary-tree-from-inorder-and-postorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/construct-binary-tree-from-preorder-and-inorder-traversal/index.spec.ts

@@ -1,5 +1,5 @@
 import { buildTree, buildTree2 } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('从前序与中序遍历序列构造二叉树', () => {
   describe('递归', () => {

problemset/construct-binary-tree-from-preorder-and-inorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 递归

problemset/convert-sorted-array-to-binary-search-tree/index.spec.ts

@@ -1,5 +1,5 @@
 import { sortedArrayToBST } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('将有序数组转换为二叉搜索树', () => {
   testCase(sortedArrayToBST);

problemset/convert-sorted-array-to-binary-search-tree/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 中序遍历

problemset/convert-sorted-list-to-binary-search-tree/index.spec.ts

@@ -1,6 +1,6 @@
 import { sortedListToBST, sortedListToBST2 } from './index';
-import { ListNode, createListNode } from '../../utils/listNode';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { ListNode, createListNode } from '~/utils/listNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('有序链表转换二叉搜索树', () => {
   describe('分治', () => {

problemset/convert-sorted-list-to-binary-search-tree/index.ts

@@ -1,5 +1,5 @@
-import { TreeNode } from '../../utils/treeNode';
-import { ListNode } from '../../utils/listNode';
+import { TreeNode } from '~/utils/treeNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 分治

problemset/copy-list-with-random-pointer/index.spec.ts

@@ -1,7 +1,7 @@
 import {
   Node,
   createListNodeWithRandomPointer
-} from '../../utils/listNodeWithRandomPointer';
+} from '~/utils/listNodeWithRandomPointer';
 import { copyRandomList, copyRandomList2 } from './index';
 
 describe('复制带随机指针的链表', () => {

problemset/copy-list-with-random-pointer/index.ts

@@ -1,4 +1,4 @@
-import { Node } from '../../utils/listNodeWithRandomPointer';
+import { Node } from '~/utils/listNodeWithRandomPointer';
 
 /**
  * 回溯 + 哈希表

problemset/flatten-binary-tree-to-linked-list/index.spec.ts

@@ -1,5 +1,5 @@
 import { flatten, flatten2, flatten3 } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('二叉树展开为链表', () => {
   describe('前序遍历', () => {

problemset/flatten-binary-tree-to-linked-list/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 前序遍历

problemset/four-sum/index.spec.ts

@@ -1,5 +1,5 @@
 import { fourSum } from './index';
-import { twoDimensionalArrayEqual } from '../../utils/tools';
+import { twoDimensionalArrayEqual } from '~/utils/tools';
 
 describe('四数之和', () => {
   describe('排序+双指针', () => {

problemset/group-anagrams/index.spec.ts

@@ -1,4 +1,4 @@
-import { twoDimensionalArrayEqual } from '../../utils/tools';
+import { twoDimensionalArrayEqual } from '~/utils/tools';
 import { groupAnagrams } from './index';
 
 describe('字母异位词分组', () => {

problemset/insert-interval/index.spec.ts

@@ -1,4 +1,4 @@
-import { twoDimensionalArrayEqual } from '../../utils/tools';
+import { twoDimensionalArrayEqual } from '~/utils/tools';
 import { insert } from './index';
 
 describe('插入区间', () => {

problemset/insertion-sort-list/index.spec.ts

@@ -1,4 +1,4 @@
-import { ListNode, createListNode } from '../../utils/listNode';
+import { ListNode, createListNode } from '~/utils/listNode';
 import { insertionSortList } from './index';
 
 describe('对链表进行插入排序', () => {

problemset/insertion-sort-list/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 从前往后找插入点

problemset/intersection-of-two-linked-lists/index.spec.ts

@@ -1,4 +1,4 @@
-import { ListNode, createIntersectionListNode } from '../../utils/listNode';
+import { ListNode, createIntersectionListNode } from '~/utils/listNode';
 import { getIntersectionNode, getIntersectionNode2 } from './index';
 
 describe('相交链表', () => {

problemset/intersection-of-two-linked-lists/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 哈希表

problemset/linked-list-cycle-ii/index.spec.ts

@@ -1,5 +1,5 @@
 import { detectCycle, detectCycle2 } from './index';
-import { createCycleListNode, ListNode } from '../../utils/listNode';
+import { createCycleListNode, ListNode } from '~/utils/listNode';
 
 describe('环形链表 II', () => {
   describe('哈希表', () => {

problemset/linked-list-cycle-ii/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 哈希表

problemset/linked-list-cycle/index.spec.ts

@@ -1,5 +1,5 @@
 import { hasCycle, hasCycle2 } from './index';
-import { ListNode, createCycleListNode } from '../../utils/listNode';
+import { ListNode, createCycleListNode } from '~/utils/listNode';
 
 describe('环形链表', () => {
   describe('哈希表', () => {

problemset/linked-list-cycle/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 哈希表

problemset/maximum-depth-of-binary-tree/index.spec.ts

@@ -1,5 +1,5 @@
 import { maxDepth, maxDepth2 } from './index';
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 
 describe('二叉树的最大深度', () => {
   describe('深度优先遍历', function () {

problemset/maximum-depth-of-binary-tree/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 深度优先遍历

problemset/merge-intervals/index.spec.ts

@@ -1,4 +1,4 @@
-import { twoDimensionalArrayEqual } from '../../utils/tools';
+import { twoDimensionalArrayEqual } from '~/utils/tools';
 import { merge } from './index';
 
 describe('合并区间', () => {

problemset/merge-k-sorted-lists/index.spec.ts

@@ -1,4 +1,4 @@
-import { ListNode, createListNode } from '../../utils/listNode';
+import { ListNode, createListNode } from '~/utils/listNode';
 import { mergeKLists, mergeKLists2 } from './index';
 
 describe('合并K个升序链表', () => {

problemset/merge-k-sorted-lists/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 优先队列

problemset/merge-two-sorted-lists/index.spec.ts

@@ -1,5 +1,5 @@
 import { mergeTwoLists, mergeTwoLists2 } from './index';
-import { ListNode, createListNode } from '../../utils/listNode';
+import { ListNode, createListNode } from '~/utils/listNode';
 
 describe('合并两个有序链表', () => {
   describe('递归', () => {

problemset/merge-two-sorted-lists/index.ts

@@ -1,4 +1,4 @@
-import { ListNode } from '../../utils/listNode';
+import { ListNode } from '~/utils/listNode';
 
 /**
  * 递归

problemset/minimum-depth-of-binary-tree/index.spec.ts

@@ -1,4 +1,4 @@
-import { TreeNode, createTreeNode } from '../../utils/treeNode';
+import { TreeNode, createTreeNode } from '~/utils/treeNode';
 import { minDepth, minDepth2 } from './index';
 
 describe('二叉树的最小深度', () => {

problemset/minimum-depth-of-binary-tree/index.ts

@@ -1,4 +1,4 @@
-import { TreeNode } from '../../utils/treeNode';
+import { TreeNode } from '~/utils/treeNode';
 
 /**
  * 深度优先搜索

problemset/n-ary-tree-postorder-traversal/index.spec.ts

@@ -1,4 +1,4 @@
-import { Node, createNAryTree } from '../../utils/nAryTree';
+import { Node, createNAryTree } from '~/utils/nAryTree';
 import { postorder, postorder2 } from '.';
 import { postorder3 } from './index';
 

problemset/n-ary-tree-postorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { Node } from '../../utils/nAryTree';
+import { Node } from '~/utils/nAryTree';
 
 /**
  * 递归

problemset/n-ary-tree-preorder-traversal/index.spec.ts

@@ -1,5 +1,5 @@
 import { preorder, preorder2 } from '.';
-import { Node, createNAryTree } from '../../utils/nAryTree';
+import { Node, createNAryTree } from '~/utils/nAryTree';
 
 describe('N 叉树的前序遍历', () => {
   describe('递归', () => {

problemset/n-ary-tree-preorder-traversal/index.ts

@@ -1,4 +1,4 @@
-import { Node } from '../../utils/nAryTree';
+import { Node } from '~/utils/nAryTree';
 
 /**
  * 递归

problemset/n-queens/index.spec.ts

@@ -1,4 +1,4 @@
-import { twoDimensionalArrayEqual } from '../../utils/tools';
+import { twoDimensionalArrayEqual } from '~/utils/tools';
 import { solveNQueens } from './index';
 
 describe('N 皇后', () => {

problemset/partition-list/index.spec.ts

@@ -1,4 +1,4 @@
-import { ListNode, createListNode } from '../../utils/listNode';
+import { ListNode, createListNode } from '~/utils/listNode';
 import { partition } from './index';
 
 describe('分隔链表', () => {