fix: import path

SR2k · SR2k · commit 60d129c47d21 · 2022-02-16T18:03:48.000+08:00
Signed-off-by: Luozhou (Siyuan Cao) &lt;luozhou.csy@alibaba-inc.com&gt;
diff --git a/tests/1.两数之和.test.ts b/tests/1.两数之和.test.ts
@@ -1,4 +1,4 @@
-import { twoSum } from './1.两数之和'
+import { twoSum } from '../1.两数之和'
 
 describe('twoSum', () => {
   it('works', () => {
diff --git a/tests/102.二叉树的层序遍历.test.ts b/tests/102.二叉树的层序遍历.test.ts
@@ -1,5 +1,5 @@
-import { TreeNode } from './commons/Tree'
-import { levelOrder } from './102.二叉树的层序遍历'
+import { TreeNode } from '../commons/Tree'
+import { levelOrder } from '../102.二叉树的层序遍历'
 
 describe('102. Binary Tree Level Order Traversal', () => {
   it('should work', () => {
diff --git a/tests/103.二叉树的锯齿形层序遍历.test.ts b/tests/103.二叉树的锯齿形层序遍历.test.ts
@@ -1,5 +1,5 @@
-import { TreeNode } from './commons/Tree'
-import { zigzagLevelOrder } from './103.二叉树的锯齿形层序遍历'
+import { TreeNode } from '../commons/Tree'
+import { zigzagLevelOrder } from '../103.二叉树的锯齿形层序遍历'
 
 describe('103. Binary Tree Zigzag Level Order Traversal', () => {
   it('should work', () => {
diff --git a/tests/116.填充每个节点的下一个右侧节点指针.test.ts b/tests/116.填充每个节点的下一个右侧节点指针.test.ts
@@ -1,6 +1,6 @@
-import { TreeNode } from './commons/Tree'
-import { connect } from './116.填充每个节点的下一个右侧节点指针'
-import { Node } from './117.填充每个节点的下一个右侧节点指针-ii'
+import { TreeNode } from '../commons/Tree'
+import { connect } from '../116.填充每个节点的下一个右侧节点指针'
+import { Node } from '../117.填充每个节点的下一个右侧节点指针-ii'
 
 describe('116. Populating Next Right Pointers in Each Node', () => {
   it('should work', () => {
diff --git a/tests/117.填充每个节点的下一个右侧节点指针-ii.test.ts b/tests/117.填充每个节点的下一个右侧节点指针-ii.test.ts
@@ -1,5 +1,5 @@
-import { Node, connect } from './117.填充每个节点的下一个右侧节点指针-ii'
-import { TreeNode } from './commons/Tree'
+import { Node, connect } from '../117.填充每个节点的下一个右侧节点指针-ii'
+import { TreeNode } from '../commons/Tree'
 
 describe('117. Populating Next Right Pointers in Each Node II', () => {
   it('should work', () => {
diff --git a/tests/121.买卖股票的最佳时机.test.ts b/tests/121.买卖股票的最佳时机.test.ts
@@ -1,4 +1,4 @@
-import { maxProfit } from './121.买卖股票的最佳时机'
+import { maxProfit } from '../121.买卖股票的最佳时机'
 
 describe('Best Time to Buy and Sell Stoks', () => {
   it('works', () => {
diff --git a/tests/13.罗马数字转整数.test.ts b/tests/13.罗马数字转整数.test.ts
@@ -1,4 +1,4 @@
-import { romanToInt } from './13.罗马数字转整数'
+import { romanToInt } from '../13.罗马数字转整数'
 
 describe('13. Roman to Integer', () => {
   it('should work', () => {
diff --git a/tests/138.复制带随机指针的链表.test.ts b/tests/138.复制带随机指针的链表.test.ts
@@ -1,4 +1,4 @@
-import { copyRandomList, Node } from './138.复制带随机指针的链表'
+import { copyRandomList, Node } from '../138.复制带随机指针的链表'
 
 describe('copyRandomList', () => {
   it('works', () => {
diff --git a/tests/144.二叉树的前序遍历.test.ts b/tests/144.二叉树的前序遍历.test.ts
@@ -1,5 +1,5 @@
-import { preorderTraversal } from './144.二叉树的前序遍历'
-import { TreeNode } from './commons/Tree'
+import { preorderTraversal } from '../144.二叉树的前序遍历'
+import { TreeNode } from '../commons/Tree'
 
 describe('144. Binary Tree Preorder Traversal', () => {
   it('should work', () => {
diff --git a/tests/1448.统计二叉树中好节点的数目.test.ts b/tests/1448.统计二叉树中好节点的数目.test.ts
@@ -1,5 +1,5 @@
-import { goodNodes, goodNodesIteration } from './1448.统计二叉树中好节点的数目'
-import { TreeNode } from './commons/Tree'
+import { goodNodes, goodNodesIteration } from '../1448.统计二叉树中好节点的数目'
+import { TreeNode } from '../commons/Tree'
 
 describe('Count Good Nodes in Binary Tree', () => {
   it('works', () => {
diff --git a/tests/146.lru-缓存.test.ts b/tests/146.lru-缓存.test.ts
@@ -1,4 +1,4 @@
-import { LRUCache } from './146.lru-缓存'
+import { LRUCache } from '../146.lru-缓存'
 
 describe('LRUCache', () => {
   let lruCache: LRUCache
diff --git a/tests/15.三数之和.test.ts b/tests/15.三数之和.test.ts
@@ -1,5 +1,5 @@
-import { threeSum } from './15.三数之和'
-import { deepSorted } from './commons/utils'
+import { threeSum } from '../15.三数之和'
+import { deepSorted } from '../commons/utils'
 
 describe('15. 3Sum', () => {
   it('should work', () => {
diff --git a/tests/151.翻转字符串里的单词.test.ts b/tests/151.翻转字符串里的单词.test.ts
@@ -1,4 +1,4 @@
-import { reverseWords } from './151.翻转字符串里的单词'
+import { reverseWords } from '../151.翻转字符串里的单词'
 
 describe('', () => {
   it('works', () => {
diff --git a/tests/16.最接近的三数之和.test.ts b/tests/16.最接近的三数之和.test.ts
@@ -1,4 +1,4 @@
-import { threeSumClosest } from './16.最接近的三数之和'
+import { threeSumClosest } from '../16.最接近的三数之和'
 
 describe('16. 3Sum Closest', () => {
   it('should work', () => {
diff --git a/tests/17.电话号码的字母组合.test.ts b/tests/17.电话号码的字母组合.test.ts
@@ -1,4 +1,4 @@
-import { letterCombinations } from './17.电话号码的字母组合'
+import { letterCombinations } from '../17.电话号码的字母组合'
 
 describe('letter-combinations-of-a-phone-number', () => {
   it('works', () => {
diff --git a/tests/2.两数相加.test.ts b/tests/2.两数相加.test.ts
@@ -1,5 +1,5 @@
-import { addTwoNumbers } from './2.两数相加'
-import { ListNode } from './commons/list'
+import { addTwoNumbers } from '../2.两数相加'
+import { ListNode } from '../commons/list'
 
 describe('addTwoNumbers', () => {
   it('works for zeros', () => {
diff --git a/tests/20.有效的括号.test.ts b/tests/20.有效的括号.test.ts
@@ -1,4 +1,4 @@
-import { isValid } from './20.有效的括号'
+import { isValid } from '../20.有效的括号'
 
 describe('validateParentheses', () => {
   it('works', () => {
diff --git a/tests/200.岛屿数量.test.ts b/tests/200.岛屿数量.test.ts
@@ -1,4 +1,4 @@
-import { numIslands } from './200.岛屿数量'
+import { numIslands } from '../200.岛屿数量'
 
 describe('numIslands', () => {
   it('works', () => {
diff --git a/tests/206.反转链表.test.ts b/tests/206.反转链表.test.ts
@@ -1,5 +1,5 @@
-import { reverseList } from './206.反转链表'
-import { ListNode } from './commons/list'
+import { reverseList } from '../206.反转链表'
+import { ListNode } from '../commons/list'
 
 describe('reverseList', () => {
   it('works', () => {
diff --git a/tests/21.合并两个有序链表.test.ts b/tests/21.合并两个有序链表.test.ts
@@ -1,5 +1,5 @@
-import { mergeTwoLists } from './21.合并两个有序链表'
-import { ListNode } from './commons/list'
+import { mergeTwoLists } from '../21.合并两个有序链表'
+import { ListNode } from '../commons/list'
 
 describe('mergeTwoLists', () => {
   it('works', () => {
diff --git a/tests/212.单词搜索-ii.test.ts b/tests/212.单词搜索-ii.test.ts
@@ -1,4 +1,4 @@
-import { findWords } from './212.单词搜索-ii'
+import { findWords } from '../212.单词搜索-ii'
 
 describe('212. Word Search II', () => {
   test('it works', () => {
diff --git a/tests/22.括号生成.test.ts b/tests/22.括号生成.test.ts
@@ -1,4 +1,4 @@
-import { generateParenthesis } from './22.括号生成'
+import { generateParenthesis } from '../22.括号生成'
 
 describe('22. Generate Parentheses', () => {
   it('should work', () => {
diff --git a/tests/236.二叉树的最近公共祖先.test.ts b/tests/236.二叉树的最近公共祖先.test.ts
@@ -1,5 +1,5 @@
-import { TreeNode } from './commons/Tree'
-import { lowestCommonAncestor } from './236.二叉树的最近公共祖先'
+import { TreeNode } from '../commons/Tree'
+import { lowestCommonAncestor } from '../236.二叉树的最近公共祖先'
 
 describe('236. Lowest Common Ancestor of a Binary Tree', () => {
   it('works', () => {
diff --git a/tests/253.会议室-ii.test.ts b/tests/253.会议室-ii.test.ts
@@ -1,4 +1,4 @@
-import { minMeetingRooms } from './253.会议室-ii'
+import { minMeetingRooms } from '../253.会议室-ii'
 
 describe('253. Meeting Rooms II', () => {
   it('should work', () => {
diff --git a/tests/259.较小的三数之和.test.ts b/tests/259.较小的三数之和.test.ts
@@ -1,4 +1,4 @@
-import { threeSumSmaller } from './259.较小的三数之和'
+import { threeSumSmaller } from '../259.较小的三数之和'
 
 describe('259. 3Sum Smaller', () => {
   it('should work', () => {
diff --git a/tests/3.无重复字符的最长子串.test.ts b/tests/3.无重复字符的最长子串.test.ts
@@ -1,4 +1,4 @@
-import { lengthOfLongestSubstring } from './3.无重复字符的最长子串'
+import { lengthOfLongestSubstring } from '../3.无重复字符的最长子串'
 
 describe('lengthOfLongestSubstring', () => {
   it('works', () => {
diff --git a/tests/322.零钱兑换.test.ts b/tests/322.零钱兑换.test.ts
@@ -1,4 +1,4 @@
-import { coinChange } from './322.零钱兑换'
+import { coinChange } from '../322.零钱兑换'
 
 describe('322. Coin Change', () => {
   it('works', () => {
diff --git a/tests/33.搜索旋转排序数组.test.ts b/tests/33.搜索旋转排序数组.test.ts
@@ -1,4 +1,4 @@
-import { search } from './33.搜索旋转排序数组'
+import { search } from '../33.搜索旋转排序数组'
 
 describe('Search in Rotated Sorted Array', () => {
   it('works', () => {
diff --git a/tests/46.全排列.test.ts b/tests/46.全排列.test.ts
@@ -1,5 +1,5 @@
-import { permute } from './46.全排列'
-import { mergeSorted } from './commons/utils'
+import { permute } from '../46.全排列'
+import { mergeSorted } from '../commons/utils'
 
 describe('46. Permutations', () => {
   it('works', () => {
diff --git a/tests/48.旋转图像.test.ts b/tests/48.旋转图像.test.ts
@@ -1,4 +1,4 @@
-import { rotate } from './48.旋转图像'
+import { rotate } from '../48.旋转图像'
 
 describe('48. Rotate Image', () => {
   it('should work', () => {
diff --git a/tests/49.字母异位词分组.test.ts b/tests/49.字母异位词分组.test.ts
@@ -1,4 +1,4 @@
-import { groupAnagrams } from './49.字母异位词分组'
+import { groupAnagrams } from '../49.字母异位词分组'
 
 const sorted = (arr: string[][]) => arr
   .map((x) => x.sort())
diff --git a/tests/5.最长回文子串.test.ts b/tests/5.最长回文子串.test.ts
@@ -1,4 +1,4 @@
-import { longestPalindrome } from './5.最长回文子串'
+import { longestPalindrome } from '../5.最长回文子串'
 
 describe('longestPalindrome', () => {
   it('works when longest length is odd', () => {
diff --git a/tests/53.最大子数组和.test.ts b/tests/53.最大子数组和.test.ts
@@ -1,4 +1,4 @@
-import { maxSubArray } from './53.最大子数组和'
+import { maxSubArray } from '../53.最大子数组和'
 
 describe('maxSubArray', () => {
   it('works', () => {
diff --git a/tests/54.螺旋矩阵.test.ts b/tests/54.螺旋矩阵.test.ts
@@ -1,4 +1,4 @@
-import { spiralOrder } from './54.螺旋矩阵'
+import { spiralOrder } from '../54.螺旋矩阵'
 
 describe('spiralOrder', () => {
   it('works', () => {
diff --git a/tests/56.合并区间.test.ts b/tests/56.合并区间.test.ts
@@ -1,4 +1,4 @@
-import { merge } from './56.合并区间'
+import { merge } from '../56.合并区间'
 
 describe('56. Merge Intervals', () => {
   it('should work', () => {
diff --git a/tests/7.整数反转.test.ts b/tests/7.整数反转.test.ts
@@ -1,4 +1,4 @@
-import { reverse } from './7.整数反转'
+import { reverse } from '../7.整数反转'
 
 describe('7. Reverse Integer', () => {
   it('should work', () => {
diff --git a/tests/79.单词搜索.test.ts b/tests/79.单词搜索.test.ts
@@ -1,4 +1,4 @@
-import { exist } from './79.单词搜索'
+import { exist } from '../79.单词搜索'
 
 describe('79. Word Search', () => {
   it('should work', () => {
diff --git a/tests/8.字符串转换整数-atoi.test.ts b/tests/8.字符串转换整数-atoi.test.ts
@@ -1,4 +1,4 @@
-import { myAtoi } from './8.字符串转换整数-atoi'
+import { myAtoi } from '../8.字符串转换整数-atoi'
 
 describe('8. String to Integer (atoi)', () => {
   it('should work for valid strings', () => {
diff --git a/tests/88.合并两个有序数组.test.ts b/tests/88.合并两个有序数组.test.ts
@@ -1,4 +1,4 @@
-import { merge } from './88.合并两个有序数组'
+import { merge } from '../88.合并两个有序数组'
 
 describe('88. Merge Sorted Array', () => {
   it('works for non empty arrays', () => {
diff --git a/tests/94.二叉树的中序遍历.test.ts b/tests/94.二叉树的中序遍历.test.ts
@@ -1,5 +1,5 @@
-import { TreeNode } from './commons/Tree'
-import { inorderTraversal } from './94.二叉树的中序遍历'
+import { TreeNode } from '../commons/Tree'
+import { inorderTraversal } from '../94.二叉树的中序遍历'
 
 describe('94. Binary Tree Inorder Traversal', () => {
   it('should work', () => {
diff --git a/tests/98.验证二叉搜索树.test.ts b/tests/98.验证二叉搜索树.test.ts
@@ -1,5 +1,5 @@
-import { isValidBST } from './98.验证二叉搜索树'
-import { TreeNode } from './commons/Tree'
+import { isValidBST } from '../98.验证二叉搜索树'
+import { TreeNode } from '../commons/Tree'
 
 describe('98. Validate Binary Search Tree', () => {
   it('should work', () => {

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { twoSum } from './1.两数之和'`
	`1`	`+import { twoSum } from '../1.两数之和'`
`2`	`2`
`3`	`3`	`describe('twoSum', () => {`
`4`	`4`	`it('works', () => {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { maxProfit } from './121.买卖股票的最佳时机'`
	`1`	`+import { maxProfit } from '../121.买卖股票的最佳时机'`
`2`	`2`
`3`	`3`	`describe('Best Time to Buy and Sell Stoks', () => {`
`4`	`4`	`it('works', () => {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { romanToInt } from './13.罗马数字转整数'`
	`1`	`+import { romanToInt } from '../13.罗马数字转整数'`
`2`	`2`
`3`	`3`	`describe('13. Roman to Integer', () => {`
`4`	`4`	`it('should work', () => {`
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import { copyRandomList, Node } from './138.复制带随机指针的链表'`
	`1`	`+import { copyRandomList, Node } from '../138.复制带随机指针的链表'`
`2`	`2`
`3`	`3`	`describe('copyRandomList', () => {`
`4`	`4`	`it('works', () => {`