docs: change readme

Author: SmallTeddy

Readme.md

@@ -8,10 +8,11 @@
 - [x] 1.模板:获取js的函数体并替换生成文件中的@function
 - [x] 2.模板:从detail中获取输入用例的数据填充@Testcase
 - [x] 3.模板:获取跳转每日一题的链接替换@url
-- [ ] 4.函数:优化时间和资源统计函数
+- [x] 4.函数:优化时间和资源统计函数
 - [ ] 5.优化创建时的体验，添加重复时候的确认覆盖或者添加额外符号
 - [ ] 6.特殊数据结构的处理(ListNode,Stack等)的处理
 - [ ] 7.创建某一特定编号的题目脚本
+- [ ] 8.题目中图片的预览功能
 
 ## How to use for yourself ?
 

common/scripts/checkToday.js

@@ -4,6 +4,7 @@ const { temExe } = require("../utils/temExe");
  * 检查今天的题目
  */
 const today = readStore("today-tag");
+// const today = 2645;
 console.log("今日的题目编号/名称为:" + today);
 temExe('node ./src/{0}/index.js', today)
     .then(res => console.log(`执行结果:\n${res}`))

common/utils/withTimeLog.js

@@ -1,19 +1,34 @@
-const { getHeapStatistics } = require("v8");
+const v8 = require("v8");
 const { getFileSize } = require("./sizeUtil");
-const {isSameData} = require("./isSameData");
+const { isSameData } = require("./isSameData");
 
-function withTimeLog(callback,compare) {
+function withTimeLog(callback, compare) {
     // 获取函数执行前的内存使用情况
-    const startMemUsage = process.memoryUsage().heapUsed
+    const startHeapStats = v8.getHeapStatistics();
     console.time("函数执行用时");
     const callVal = callback()
+    // 获取函数执行后的内存使用情况
+    const endHeapStats = v8.getHeapStatistics();
     console.log(callVal);
     console.timeEnd("函数执行用时")
-    // 获取函数执行后的内存使用情况
-    const endMemUsage = process.memoryUsage().heapUsed;
-    // 计算内存使用率（以字节为单位）
-    const memoryUsageInBytes = endMemUsage - startMemUsage;
-    console.log(`内存占用：${getFileSize(memoryUsageInBytes)}`)
+
+    // console.log('\n', {
+    //     '当前堆内存的使用量': startHeapStats.used_heap_size,
+    //     '在程序执行过程中达到的内存峰值': startHeapStats.peak_malloced_memory,
+    //     '衡量全局对象句柄的内存使用量': startHeapStats.used_global_handles_size
+    // }, '\n', {
+    //     '当前堆内存的使用量': endHeapStats.used_heap_size,
+    //     '在程序执行过程中达到的内存峰值': endHeapStats.peak_malloced_memory,
+    //     '衡量全局对象句柄的内存使用量': endHeapStats.used_global_handles_size
+    // })
+
+    // 计算内存使用情况（以字节为单位）
+    const heapMemoryUsageInBytes = endHeapStats.used_heap_size - startHeapStats.used_heap_size;
+    // 计算内存使用情况
+    console.log(`内存占用：${getFileSize(heapMemoryUsageInBytes)}`)
+    // const memoryUsagePercentage = (heapMemoryUsageInBytes / endHeapStats.total_available_size) * 100;
+    // console.log(`内存占用率：${memoryUsagePercentage}`)
+    
     console.log(`预期值:${JSON.stringify(compare)},${isSameData(callVal,compare)?"测试通过!":"测试未通过!"}`)
     console.log('--------------------------')
 }

src/2182/index.js

@@ -65,6 +65,13 @@ var repeatLimitedString = function(s, repeatLimit) {
  */
 withTimeLog(() => repeatLimitedString(s = "cczazcc", repeatLimit = 3),"zzcccac");
 withTimeLog(() => repeatLimitedString(s = "aababab", repeatLimit = 2),"bbabaa");
+withTimeLog(() => repeatLimitedString(s = "cczazcc", repeatLimit = 3),"zzcccac");
+withTimeLog(() => repeatLimitedString(s = "aababab", repeatLimit = 2),"bbabaa");
+withTimeLog(() => repeatLimitedString(s = "cczazcc", repeatLimit = 3),"zzcccac");
+withTimeLog(() => repeatLimitedString(s = "aababab", repeatLimit = 2),"bbabaa");
+withTimeLog(() => repeatLimitedString(s = "cczazcc", repeatLimit = 3),"zzcccac");
+withTimeLog(() => repeatLimitedString(s = "aababab", repeatLimit = 2),"bbabaa");
+withTimeLog(() => repeatLimitedString(s = "cczazcc", repeatLimit = 3),"zzcccac");
 
 console.log("点击跳转到题目提交:https://leetcode.cn/problems/construct-string-with-repeat-limit/")
 

src/82/index.js

@@ -64,6 +64,13 @@ var deleteDuplicates = function(head) {
  * Test case
  */
 withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,2,3,3,4,4,5]))),[1,2,5]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,1,1,2,2,2,2,3,3,3,3,3,4,4,5,6,6,6,7]))),[5,7]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,1,1,2,3]))),[2,3]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,2,3,3,4,4,5]))),[1,2,5]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,1,1,2,2,2,2,3,3,3,3,3,4,4,5,6,6,6,7]))),[5,7]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,1,1,2,3]))),[2,3]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,2,3,3,4,4,5]))),[1,2,5]);
+withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,1,1,2,2,2,2,3,3,3,3,3,4,4,5,6,6,6,7]))),[5,7]);
 withTimeLog(() => parseListNode(deleteDuplicates(convertListNode(head = [1,1,1,2,3]))),[2,3]);
 
 console.log("点击跳转到题目提交:https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/")