@@ -11,3 +11,5 @@ All notable changes to the "leetcode" extension will be documented in this file.
 更新了 imports.py
 # 1.0.9
 更新了 imports.py 修改二叉树元素为0时，不生成结点的问题。
+# 1.0.10
+更新了过滤题目，只显示算法题，而数据库，shell什么的都不显示了。

@@ -2,7 +2,7 @@
 "name": "python-leetcode",
 "displayName": "PythonLeetcode",
 "description": "Solve LeetCode problems in VS Code",
-"version": "1.0.9",
+"version": "1.0.10",
 "author": "KuiyuanFu",
 "publisher": "KuiyuanFu",
 "license": "MIT",

@@ -72,6 +72,9 @@ export class LeetCodeTreeDataProvider implements vscode.TreeDataProvider<LeetCod
 return explorerNodeManager.getAllNodes();
 case Category.Favorite:
 return explorerNodeManager.getFavoriteNodes();
+// // FuCategory
+// case Category.Category:
+// return explorerNodeManager.getAllCategoryNodes();
 case Category.Difficulty:
 return explorerNodeManager.getAllDifficultyNodes();
 case Category.Tag:

@@ -36,10 +36,16 @@ class ExplorerNodeManager implements Disposable {
 id: Category.All,
 name: Category.All,
 }), false),
+// // FuCategory
+// new LeetCodeNode(Object.assign({}, defaultProblem, {
+// id: Category.Category,
+// name: Category.Category,
+// }), false),
 new LeetCodeNode(Object.assign({}, defaultProblem, {
 id: Category.Difficulty,
 name: Category.Difficulty,
 }), false),
+
 new LeetCodeNode(Object.assign({}, defaultProblem, {
 id: Category.Tag,
 name: Category.Tag,
@@ -58,7 +64,30 @@ class ExplorerNodeManager implements Disposable {
 public getAllNodes(): LeetCodeNode[] {
 return Array.from(this.explorerNodeMap.values());
 }
-
+// // FuCategory
+// public getAllCategoryNodes(): LeetCodeNode[] {
+// const res: LeetCodeNode[] = [];
+// res.push(
+// new LeetCodeNode(Object.assign({}, defaultProblem, {
+// id: `${Category.Category}.Algorithms`,
+// name: "Algorithms",
+// }), false),
+// new LeetCodeNode(Object.assign({}, defaultProblem, {
+// id: `${Category.Category}.Others`,
+// name: "Others",
+// }), false),
+// // new LeetCodeNode(Object.assign({}, defaultProblem, {
+// // id: `${Category.Category}.Medium`,
+// // name: "Medium",
+// // }), false),
+// // new LeetCodeNode(Object.assign({}, defaultProblem, {
+// // id: `${Category.Category}.Hard`,
+// // name: "Hard",
+// // }), false),
+// );
+// this.sortSubCategoryNodes(res, Category.Category);
+// return res;
+// }
 public getAllDifficultyNodes(): LeetCodeNode[] {
 const res: LeetCodeNode[] = [];
 res.push(
@@ -161,6 +190,22 @@ class ExplorerNodeManager implements Disposable {
 
 private sortSubCategoryNodes(subCategoryNodes: LeetCodeNode[], category: Category): void {
 switch (category) {
+// // FuCategory
+// case Category.Category:
+// subCategoryNodes.sort((a: LeetCodeNode, b: LeetCodeNode): number => {
+// function getValue(input: LeetCodeNode): number {
+// switch (input.name.toLowerCase()) {
+// case "algorithms":
+// return 1;
+// case "others":
+// return 2;
+// default:
+// return Number.MAX_SAFE_INTEGER;
+// }
+// }
+// return getValue(a) - getValue(b);
+// });
+// break;
 case Category.Difficulty:
 subCategoryNodes.sort((a: LeetCodeNode, b: LeetCodeNode): number => {
 function getValue(input: LeetCodeNode): number {

@@ -90,8 +90,8 @@ class LeetCodeExecutor implements Disposable {
 
 public async listProblems(showLocked: boolean): Promise<string> {
 return await this.executeCommandEx(this.nodeExecutable, showLocked ?
-[await this.getLeetCodeBinaryPath(), "list"] :
-[await this.getLeetCodeBinaryPath(), "list", "-q", "L"],
+[await this.getLeetCodeBinaryPath(), "list" ,'-t','algorithms'] :
+[await this.getLeetCodeBinaryPath(), "list",'-t','algorithms', "-q", "L"],
 );
 }
 // FuTodo 文件内容函数

@@ -96,6 +96,8 @@ export const defaultProblem: IProblem = {
 
 export enum Category {
 All = "All",
+// // FuCategory
+// Category = "Category",
 Difficulty = "Difficulty",
 Tag = "Tag",
 Company = "Company",