fix: update view for cli

Author: wh131462

bin/lc.js

@@ -17,6 +17,7 @@ import {setQuestion} from "#common/utils/store/store-realm.js";
 import {getQuestionChineseName} from "#common/utils/question-handler/getQuestionChineseName.js";
 import {easyCreateView} from "#common/view/create.view.js";
 import {description} from "#resources/text/description.js";
+import {easyUpdateView} from "#common/view/update.view.js";
 
 const version = process.env.VERSION??'0.0.0';
 program
@@ -29,6 +30,7 @@ program
     .option('-r, --random', 'Get a question randomly.')
     .option('-e, --easy', 'Use easy mode.')
     .option('-d, --directory <directory>', 'Set the question directory.')
+    .option('-u, --update','Check the version to determine whether to update to the latest one.')
     .parse(process.argv)
 
 const cmdArgs = program.args;
@@ -45,6 +47,11 @@ if(cmdOpts.easy){
     await easyCreateView();
     process.exit(0);;
 }
+// 检测更新
+if(cmdOpts.update){
+    await easyUpdateView();
+    process.exit(0);;
+}
 // 创建
 const create = (mode,question)=>{
     console.log(`MODE: ${mode}`);

bin/lk.js

@@ -15,6 +15,7 @@ import {getQuestionFileName} from "#common/utils/question-handler/getQuestionFil
 import {getQuestionChineseName} from "#common/utils/question-handler/getQuestionChineseName.js";
 import {easyCheckView} from "#common/view/check.view.js";
 import {description} from "#resources/text/description.js";
+import {easyUpdateView} from "#common/view/update.view.js";
 
 const version = process.env.VERSION ?? '0.0.0';
 program
@@ -27,6 +28,7 @@ program
     .option('-r, --random', 'Check the last random question.')
     .option('-e, --easy', 'Use easy mode.')
     .option('-d, --directory <directory>', 'Set the question directory.')
+    .option('-u, --update','Check the version to determine whether to update to the latest one.')
     .parse(process.argv)
 
 const cmdArgs = program.args;
@@ -44,7 +46,11 @@ if (cmdOpts.easy) {
     await easyCheckView();
     process.exit(0);
 }
-//
+// 检测更新
+if(cmdOpts.update){
+    await easyUpdateView();
+    process.exit(0);;
+}
 // 检测函数
 const check = async (mode, question) => {
     const filePath = path.join(baseDir, getQuestionFileName(question), 'index.js');

common/utils/etc/update.js

@@ -2,6 +2,7 @@ import https from "https";
 import {rootPath} from "#common/utils/file/getRootPath.js";
 import fs from "fs";
 import path from "path";
+import { log } from "console";
 
 const npmUrl =  `https://registry.npmjs.org/leetcode-practice`;
 const githubUrl = `https://api.github.com/repos/wh131462/leetcode-practice/commits?per_page=1`;
@@ -44,6 +45,7 @@ export const getGithubVersion = ()=>{
             });
             res.on('end', () => {
                 try {
+                    console.log(data);
                     const jsonData = JSON.parse(data);
                     const latestCommitSha = jsonData[0].sha;
                     console.log(latestCommitSha)

common/view/update.view.js

@@ -7,8 +7,7 @@ export const easyUpdateView = async()=>{
         name:"willUpdate",
         message:"检测到更新,是否进行更新?"
     };
-    getGithubVersion()
-    const {localVersion,remoteVersion,isUpdate} = {};//await checkUpdate();
+    const {localVersion,remoteVersion,isUpdate} = {};
     console.log(`当前最新版本为: ${remoteVersion}`);
     console.log(`本地版本为: ${localVersion}`);
     if(isUpdate){

docs/README_CN.md

@@ -100,6 +100,13 @@ npm run easy-fork
 ### CLI的使用
 
 #### lc
+##### 1. 帮助文档
+```shell
+lc -h 
+```
+```shell
+
+```
 
 #### lk
 

jsconfig.json

@@ -6,7 +6,7 @@
         "./common/*"
       ],
       "#resources/*": [
-        "#resources/*"
+        "./resources/*"
       ]
     }
   }

src/235.lowest-common-ancestor-of-a-binary-search-tree/description.md

@@ -0,0 +1,31 @@
+<p>给定一个二叉搜索树, 找到该树中两个指定节点的最近公共祖先。</p>
+
+<p><a href="https://baike.baidu.com/item/%E6%9C%80%E8%BF%91%E5%85%AC%E5%85%B1%E7%A5%96%E5%85%88/8918834?fr=aladdin" target="_blank">百度百科</a>中最近公共祖先的定义为：&ldquo;对于有根树 T 的两个结点 p、q，最近公共祖先表示为一个结点 x，满足 x 是 p、q 的祖先且 x 的深度尽可能大（<strong>一个节点也可以是它自己的祖先</strong>）。&rdquo;</p>
+
+<p>例如，给定如下二叉搜索树:&nbsp; root =&nbsp;[6,2,8,0,4,7,9,null,null,3,5]</p>
+
+<p><img alt="" src="https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/binarysearchtree_improved.png" style="height: 190px; width: 200px;"></p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1:</strong></p>
+
+<pre><strong>输入:</strong> root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
+<strong>输出:</strong> 6 
+<strong>解释: </strong>节点 <code>2 </code>和节点 <code>8 </code>的最近公共祖先是 <code>6。</code>
+</pre>
+
+<p><strong>示例 2:</strong></p>
+
+<pre><strong>输入:</strong> root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
+<strong>输出:</strong> 2
+<strong>解释: </strong>节点 <code>2</code> 和节点 <code>4</code> 的最近公共祖先是 <code>2</code>, 因为根据定义最近公共祖先节点可以为节点本身。</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>说明:</strong></p>
+
+<ul>
+	<li>所有节点的值都是唯一的。</li>
+	<li>p、q 为不同节点且均存在于给定的二叉搜索树中。</li>
+</ul>

src/235.lowest-common-ancestor-of-a-binary-search-tree/index.js

@@ -0,0 +1,54 @@
+
+/**
+ * 235.二叉搜索树的最近公共祖先 [2024-02-25]
+ * 给定一个二叉搜索树, 找到该树中两个指定节点的最近公共祖先。
+ * 百度百科中最近公共祖先的定义为：“对于有根树 T 的两个结点 p、q，最近公共祖先表示为一个结点 x，满足 x 是 p、q 的祖先且 x 的深度尽可能大（一个节点也可以是它自己的祖先）。”
+ * 例如，给定如下二叉搜索树:  root = [6,2,8,0,4,7,9,null,null,3,5]
+ *  
+ * 示例 1:
+ * 输入: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 8
+ * 输出: 6 
+ * 解释: 节点 2 和节点 8 的最近公共祖先是 6。
+ * 示例 2:
+ * 输入: root = [6,2,8,0,4,7,9,null,null,3,5], p = 2, q = 4
+ * 输出: 2
+ * 解释: 节点 2 和节点 4 的最近公共祖先是 2, 因为根据定义最近公共祖先节点可以为节点本身。
+ *  
+ * 说明:
+ * 	所有节点的值都是唯一的。
+ * 	p、q 为不同节点且均存在于给定的二叉搜索树中。
+ * 
+ */
+/**
+ * Definition for a binary tree node.
+ * function TreeNode(val) {
+ *     this.val = val;
+ *     this.left = this.right = null;
+ * }
+ */
+
+/**
+ * @param {TreeNode} root
+ * @param {TreeNode} p
+ * @param {TreeNode} q
+ * @return {TreeNode}
+ */
+var lowestCommonAncestor = function(root, p, q) {
+    
+};
+
+/**
+ * Test case
+ */
+showLogs(
+    lowestCommonAncestor,
+    {
+        data: [[  [6,2,8,0,4,7,9,null,null,3,5],  2,  8],[  [6,2,8,0,4,7,9,null,null,3,5],  2,  4]],
+        structure: ["TreeNode","TreeNode","TreeNode"],
+    },
+    {
+        data: [ 6 , 2],
+        structure: ["TreeNode"]
+    }
+)
+console.log('点击跳转到题目提交:https://leetcode.cn/problems/lowest-common-ancestor-of-a-binary-search-tree/');