再次优化README 增加数据结构部分内容

Author: su-Pro

.DS_Store

@@ -5,13 +5,53 @@
       "path": "README.md"
     },
     {
-      "basename": "51. N 皇后",
-      "path": "2. coding/51. N 皇后.md"
+      "basename": "index",
+      "path": "1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/index.md"
     },
     {
       "basename": "index",
       "path": "2. coding/index.md"
     },
+    {
+      "basename": "内推模板",
+      "path": "temp/内推模板.md"
+    },
+    {
+      "basename": "DOM检查 ？react 解析器？开源工具？",
+      "path": "DOM检查 ？react 解析器？开源工具？.md"
+    },
+    {
+      "basename": "leetcode 拷贝题目模板",
+      "path": "temp/leetcode 拷贝题目模板.md"
+    },
+    {
+      "basename": "index",
+      "path": "1. cs/《Problem solving with algorithms and Data Structures Using Python》/index.md"
+    },
+    {
+      "basename": "操作系统层面的调用栈管理？",
+      "path": "操作系统层面的调用栈管理？.md"
+    },
+    {
+      "basename": "栈",
+      "path": "1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/栈.md"
+    },
+    {
+      "basename": "何为数据结构与算法？",
+      "path": "1. cs/《Problem solving with algorithms and Data Structures Using Python》/何为数据结构与算法？.md"
+    },
+    {
+      "basename": "浏览器历史管理",
+      "path": "浏览器历史管理.md"
+    },
+    {
+      "basename": "Pasted image 20220102214927",
+      "path": "static/Pasted image 20220102214927.png"
+    },
+    {
+      "basename": "51. N 皇后",
+      "path": "2. coding/51. N 皇后.md"
+    },
     {
       "basename": "index",
       "path": "3. sd/FE/index.md"
@@ -48,10 +88,6 @@
       "basename": "59. 螺旋矩阵 II",
       "path": "2. coding/59. 螺旋矩阵 II.md"
     },
-    {
-      "basename": "leetcode 拷贝题目模板",
-      "path": "temp/leetcode 拷贝题目模板.md"
-    },
     {
       "basename": "59. 螺旋矩阵 II",
       "path": "coding/beginner/recursion/59. 螺旋矩阵 II.md"

.idea/misc.xml

@@ -4,27 +4,15 @@
     "type": "split",
     "children": [
       {
-        "id": "6db266198f75c765",
+        "id": "2cf85588b3df5d0a",
         "type": "leaf",
         "state": {
           "type": "markdown",
           "state": {
             "file": "README.md",
             "mode": "preview"
           }
-        },
-        "group": "7fe7d837d39d8f54"
-      },
-      {
-        "id": "fc6256f5f8f939fc",
-        "type": "leaf",
-        "state": {
-          "type": "outline",
-          "state": {
-            "file": "README.md"
-          }
-        },
-        "group": "7fe7d837d39d8f54"
+        }
       }
     ],
     "direction": "vertical"
@@ -80,7 +68,7 @@
       }
     ],
     "direction": "horizontal",
-    "width": 351.49999809265137
+    "width": 718.9999980926514
   },
   "right": {
     "id": "c2caebd2760df946",
@@ -125,17 +113,17 @@
     "width": 255.35166931152344,
     "collapsed": true
   },
-  "active": "6db266198f75c765",
+  "active": "2cf85588b3df5d0a",
   "lastOpenFiles": [
     "README.md",
-    "2. coding/51. N 皇后.md",
+    "1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/index.md",
     "2. coding/index.md",
-    "3. sd/FE/index.md",
-    "2. coding/2-training/198.打家劫舍.md",
-    "coding/2-training/213.打家劫舍 II.md",
-    "2. coding/1-beginner/1. sorting/283. 移动零.md",
-    "log/2022年计划.md",
-    "coding/1-beginner/beginer - index.md",
-    "2. coding/2-training/index.md"
+    "temp/内推模板.md",
+    "DOM检查 ？react 解析器？开源工具？.md",
+    "temp/leetcode 拷贝题目模板.md",
+    "1. cs/《Problem solving with algorithms and Data Structures Using Python》/index.md",
+    "操作系统层面的调用栈管理？.md",
+    "1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/栈.md",
+    "1. cs/《Problem solving with algorithms and Data Structures Using Python》/何为数据结构与算法？.md"
   ]
 }

.obsidian/plugins/recent-files-obsidian/data.json

@@ -0,0 +1,11 @@
+# Table of Contents
+
+> ❗️ 只记录书中讲述的重点内容，以及补充以下链接关系：
+> - 数据结构的工业应用
+> - 经典/有趣/ leetcode题
+
+[[何为数据结构与算法？]]
+
+
+[[1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/index]]
+

.obsidian/workspace

@@ -0,0 +1,14 @@
+# 线性数据结构
+
+- 理解何为线性
+- 基本ADT：栈、队列、双端队列和列表
+
+
+## 线性（属性）定义
+
+1. 有序的数据集合，其元素的顺序由添加和删除时机决定
+2. 删除/新增元素到集合中时，不会影响其他元素的相对位置
+
+## 重要结构
+
+1. [[栈]]

1. cs/《Problem solving with algorithms and Data Structures Using Python》/index.md

@@ -0,0 +1,31 @@
+class MyStack:
+    def __init__(self):
+        self.items = []
+
+    def is_empty(self) -> bool:
+        return len(self.items) == 0
+
+    # def push(self, item):
+    #     self.items.append(item)
+
+    def push(self, item):
+        self.items.insert(0, item)
+
+    # def pop(self):
+    #     return self.items.pop()
+
+    def pop(self):
+        return self.items.pop(0)
+
+    # 如何使用切片和解构返回顶部元素呢？
+    def peek(self):
+        return self.items[len(self.items) - 1]
+
+    def size(self):
+        return len(self.items)
+
+
+stack = MyStack()
+
+stack.push('1')
+print(stack.size())

1. cs/《Problem solving with algorithms and Data Structures Using Python》/何为数据结构与算法？.md

@@ -0,0 +1,95 @@
+# 栈
+
+## 性质
+
+### 性质1: LIFO
+
+提供一种基于数据停留在集合中的时间来排序的方式，时长短的在顶部，反之在底部。
+
+### 性质2: 反转（盗梦空间）
+
+## ADT 与实现
+
+### ADT
+
+- Stack()创建一个空栈。它不需要参数,且会返回一个空栈。 
+- push(item)将一个元素添加到栈的顶端。它需要一个参数 item,且无返回值。 
+- pop()将栈顶端的元素移除。它不需要参数,但会返回顶端的元素,并且修改栈的内容。 
+- peek()返回栈顶端的元素,但是并不移除该元素。它不需要参数,也不会修改栈的内容。 
+- isEmpty()检查栈是否为空。它不需要参数,且会返回一个布尔值。 
+- size()返回栈中元素的数目。它不需要参数,且会返回一个整数。
+
+![[Pasted image 20220102214934.png]]
+
+### 实现
+
+#### 要点
+
+1. “有序”排列
+2. 考虑栈顶使用列表的哪个位置
+
+#### 基于列表尾部/头部
+
+```python
+class MyStack:  
+    def __init__(self):  
+        self.items = []  
+  
+    def is_empty(self) -> bool:  
+        return len(self.items) == 0  
+  
+ # def push(self, item):  
+ #     self.items.append(item)  
+ def push(self, item):  
+        self.items.insert(0, item)  
+  
+    # def pop(self):  
+ #     return self.items.pop()  
+ def pop(self):  
+        return self.items.pop(0)  
+  
+    # 如何使用切片和解构返回顶部元素呢？  
+ def peek(self):  
+        return self.items[len(self.items) - 1]  
+  
+    def size(self):  
+        return len(self.items)
+```
+
+
+## 经典案例
+
+### 进制转化
+
+### （前、中、后）序表达式转化
+
+
+- [ ] [20. 有效的括号](https://leetcode-cn.com/problems/valid-parentheses/)
+- [ ] [853. 车队](https://leetcode-cn.com/problems/car-fleet/)
+- [ ] [735. 行星碰撞](https://leetcode-cn.com/problems/asteroid-collision/)
+
+盗梦空间
+
+ [1047. 删除字符串中的所有相邻重复项](https://leetcode-cn.com/problems/remove-all-adjacent-duplicates-in-string/)
+ [150. 逆波兰表达式求值](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)
+[736. Lisp 语法解析](https://leetcode-cn.com/problems/parse-lisp-expression/)
+[224. 基本计算器](https://leetcode-cn.com/problems/basic-calculator/)
+ [241. 为运算表达式设计优先级](https://leetcode-cn.com/problems/different-ways-to-add-parentheses/)
+
+
+## 课后思考
+
+### 工业应用
+
+[[浏览器历史管理]]
+- [ ] [1472. 设计浏览器历史记录](https://leetcode-cn.com/problems/design-browser-history/)
+
+#### HTML词法解析
+
+[[DOM检查 ？react 解析器？开源工具？]]
+
+ - [ ] [591. 标签验证器](https://leetcode-cn.com/problems/tag-validator/)
+
+### 高级话题
+
+[[操作系统层面的调用栈管理？]]

1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/index.md

@@ -0,0 +1,17 @@
+/**
+ * @param {number} mass
+ * @param {number[]} asteroids
+ * @return {boolean}
+ */
+var asteroidsDestroyed = function(mass, asteroids) {
+    asteroids.sort((a,b) => a - b);
+    let m = mass;
+    for(let i = 0; i < asteroids.length;i++) {
+        if(m < asteroids[i]) return false;
+        m += asteroids[i]
+    }
+    return true
+};
+
+
+// 3

1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/my_stack.py

@@ -0,0 +1,31 @@
+/**
+ * @param {string[]} bank
+ * @return {number}
+ */
+ var numberOfBeams = function(bank) {
+     let cnt = 0;
+    for(let i = 0;i < bank.length;i++) {
+        let upCnt = getCount(bank[i]);
+        if(upCnt === 0) continue;
+
+        for(let j = i + 1;j < bank.length;j++) {
+            let downCnt = getCount(bank[j]);
+            if(downCnt === 0) continue;
+            console.log(upCnt,downCnt)
+            cnt += upCnt * downCnt;
+            break;
+        }
+
+    }
+    return cnt;
+};
+
+function getCount(str) {
+    let cnt = 0;
+    for(let c of str) {
+        if (c === '1') cnt += 1
+    }
+    return cnt
+}
+
+console.log(numberOfBeams(["011001","000000","010100","001000"]))

1. cs/《Problem solving with algorithms and Data Structures Using Python》/线性数据结构/栈.md

@@ -0,0 +1,18 @@
+/**
+ * @param {string} s
+ * @return {boolean}
+ */
+ var checkString = function(s) {
+
+    for(let i = 0;i < s.length;i++) {
+        if(s[i] !== 'b') {
+            continue;
+        }
+        // check after
+        for(let j = i + 1;j < s.length;j++) {
+            if(s[j] === 'a') return false
+        }
+    }
+    return true
+};
+console.log(checkString("aaabbb"))

2. coding/3-contest/274/1.js

@@ -0,0 +1,7 @@
+/**
+ * @param {number[]} favorite
+ * @return {number}
+ */
+ var maximumInvitations = function(favorite) {
+
+};