add 1963

Author: 2xiao

assets/output/3313.md

@@ -0,0 +1,35 @@
+# [3313. Find the Last Marked Nodes in Tree](https://leetcode.com/problems/find-the-last-marked-nodes-in-tree)
+
+🔴 <font color=#ff334b>Hard</font>&emsp; 🔖&ensp; [`树`](/leetcode/outline/tag/tree.md) [`深度优先搜索`](/leetcode/outline/tag/depth-first-search.md)&emsp; 🔗&ensp;[`LeetCode`](https://leetcode.com/problems/find-the-last-marked-nodes-in-tree)
+
+
+## 题目
+
+
+
+
+## 题目大意
+
+
+
+
+## 解题思路
+
+#### 复杂度分析
+
+- **时间复杂度**：`O()`，
+- **空间复杂度**：`O()`，
+
+## 代码
+
+```javascript
+
+```
+
+## 相关题目
+
+:::: md-demo 相关题目
+- [访问消失节点的最少时间](https://leetcode.com/problems/minimum-time-to-visit-disappearing-nodes)
+- [标记所有节点需要的时间](https://leetcode.com/problems/time-taken-to-mark-all-nodes)
+
+::::

assets/scripts/leetcode-crawler.py

@@ -32,9 +32,8 @@ def __init__(self, title_slug, *args):
         threading.Thread.__init__(self)
         self.title_slug = title_slug
         self.status = None
-        if len(args) == 2:
+        if len(args) == 1:
             self.status = args[0]
-            self.only = args[1]
     def run(self):
         IS_SUCCESS = False
         conn = sqlite3.connect(db_path, timeout=10)
@@ -81,8 +80,6 @@ def run(self):
                 resp.encoding = 'utf8'
                 content = resp.json()
 
-                if (self.only):
-                    print('------pay only content', content)
 
                 contentEN = ''
                 contentCN = ''
@@ -110,8 +107,6 @@ def run(self):
                         tags.append(tag_str)
 
 
-
-                
                 question_detail = (questionId, 
                     content['data']['question']['questionFrontendId'], 
                     content['data']['question']['questionTitle'],
@@ -181,9 +176,7 @@ def get_problems(self, filters):
         question_update_list = []
         threads = []
         cursor = self.conn.cursor()
-        count = 0
         for question in question_list['stat_status_pairs']:
-            count = count + 1
 
             question_id = question['stat']['question_id']
             question_slug = question['stat']['question__title_slug']
@@ -208,15 +201,12 @@ def get_problems(self, filters):
                 if filters['status'] != question_status:
                      continue
 
-            if question['paid_only']:
-                print('---------------------paid_only', question_id, question_slug)
-            #     continue
 
             cursor.execute('SELECT status FROM question WHERE id = ?', (question_id,))
             result = cursor.fetchone()
             if not result:
                 # 创建新线程
-                thread = insetQuestionThread(question_slug, question_status, question['paid_only'])
+                thread = insetQuestionThread(question_slug, question_status)
                 thread.start()
                 while True:  
                     #判断正在运行的线程数量,如果小于5则退出while循环,  
@@ -228,13 +218,10 @@ def get_problems(self, filters):
                 threads.append(thread)  
             elif self.is_login and question_status != result[0]:
                 question_update_list.append((question_status, question_id))
-            else:
-                print('already in db:', question_id, question_slug)
-            print('-------------', count)
+        
 
         for t in threads:
             t.join()
-        print('-------------end', count)
         cursor.executemany('UPDATE question SET status = ? WHERE id = ?', question_update_list)
         self.conn.commit()
         cursor.close()

assets/scripts/leetcode-problems.csv

@@ -3699,3 +3699,4 @@ LCP 04,LCP_04,other,Broken Board Dominoes,覆盖,broken-board-dominoes,"Bit Mani
 159,0159,0100-0199,Longest Substring with At Most Two Distinct Characters,至多包含两个不同字符的最长子串,longest-substring-with-at-most-two-distinct-characters,"Hash Table|hash-table|哈希表,String|string|字符串,Sliding Window|sliding-window|滑动窗口",Medium
 157,0157,0100-0199,Read N Characters Given Read4,用 Read4 读取 N 个字符,read-n-characters-given-read4,"Array|array|数组,Interactive|interactive|交互,Simulation|simulation|模拟",Easy
 156,0156,0100-0199,Binary Tree Upside Down,上下翻转二叉树,binary-tree-upside-down,"Tree|tree|树,Depth-First Search|depth-first-search|深度优先搜索,Binary Tree|binary-tree|二叉树",Medium
+3313,3313,3300-3399,Find the Last Marked Nodes in Tree,Find the Last Marked Nodes in Tree,find-the-last-marked-nodes-in-tree,"Tree|tree|树,Depth-First Search|depth-first-search|深度优先搜索",Hard

assets/scripts/problem-list.csv

@@ -7,6 +7,14 @@
 from urllib.parse import quote
 import const
 
+# 自定义排序函数：可转换为整数的按数值排序，非数字的按字典顺序排序
+def custom_sort(val):
+    # 尝试将值转换为整数
+    try:
+        return (0, int(val))  # 数字部分的优先级高
+    except ValueError:
+        return (1, val)  # 非数字部分的优先级次之，按字典顺序排序
+
 # 根据 frame 生成 Markdown 表格
 
 
@@ -38,7 +46,7 @@ def gen_markdown_table(frame, need_sort):
 
     # 数据部分
     if need_sort:
-        frame = frame.sort_values(by='题号')
+        frame = frame.sort_values(by='题号', key=lambda col: col.apply(custom_sort))
     frame = frame.reset_index(drop=True)
     for i in range(H):
         problem = "|"
@@ -195,7 +203,7 @@ def getFileName(id, slug):
     if str(id).find('面试题') != -1:
         return "i_" + id.split('面试题 ')[1]
     if len(str(id)) < 5:
-        return str("{:0>4d}".format(id))
+        return "{:0>4d}".format(id)
     if slug in const.offer_dict:
         return const.offer_dict[slug].split(',')[1]
     if slug in const.offer2_dict:

assets/scripts/utils.py

@@ -471,6 +471,13 @@ export default sidebar({
             "1813"
           ],
         },
+        {
+          text: "1900-1999",
+          collapsible: true,
+          children: [
+            "1963"
+          ],
+        },
         {
           text: "2100-2199",
           collapsible: true,