diff --git a/Week_01/id_19/LeetCode_1047_19.java b/Week_01/id_19/LeetCode_1047_19.java
new file mode 100644
index 00000000..19cad158
--- /dev/null
+++ b/Week_01/id_19/LeetCode_1047_19.java
@@ -0,0 +1,27 @@
+class Solution {
+    public String removeDuplicates(String S) {
+
+        /**
+         * 去重可利用栈来解
+         * 与栈顶对比，重复移除，否则入栈
+         */
+        // 将字符串转成字符
+        char[] chars = S.toCharArray();
+        Stack<Character> stack = new Stack<>();
+
+        for (int i = 0; i<chars.length; i++) {
+            if (stack.isEmpty() || stack.peek() != chars[i]) {
+                stack.push(chars[i]);
+            }else {
+                stack.pop();
+            }
+        }
+
+        StringBuilder sb = new StringBuilder();
+        for (char c: stack) {
+            sb.append(c);
+        }
+        
+        return sb.toString();
+    }
+}
diff --git a/Week_01/id_19/LeetCode_24_19.java b/Week_01/id_19/LeetCode_24_19.java
new file mode 100644
index 00000000..7197c084
--- /dev/null
+++ b/Week_01/id_19/LeetCode_24_19.java
@@ -0,0 +1,14 @@
+class Solution {
+    public ListNode swapPairs(ListNode head) {
+        // 终止条件只有一个结点或者无结点
+        if (head == null || head.next == null) {
+            return head;
+        }
+        
+        ListNode nextNode = head.next;
+        // 递归条件 f(n) = f(n+1)
+        head.next = swapPairs(nextNode.next);
+        nextNode.next = head;
+        return nextNode;
+    }
+}
diff --git a/Week_01/id_19/LeetCode_26_19.java b/Week_01/id_19/LeetCode_26_19.java
new file mode 100644
index 00000000..c9fddb1b
--- /dev/null
+++ b/Week_01/id_19/LeetCode_26_19.java
@@ -0,0 +1,22 @@
+class Solution {
+    public int removeDuplicates(int[] nums) {
+        
+        // 时间复杂度为O(n)
+        // 数组判断
+        if (nums.length == 0) {
+            return 0;
+        }
+        // 假设不相等的位置为1
+        int uniquePos = 1;
+        for(int i = 1;i < nums.length; i++) {
+            // 这里要注意数组越界问题
+            if (nums[i] != nums[i-1]) {
+                // 数组往前移动
+                nums[uniquePos] = nums[i];
+                uniquePos++;
+            }
+        }
+        return uniquePos;
+        
+    }
+}
diff --git a/Week_01/id_19/NOTE.md b/Week_01/id_19/NOTE.md
index 624c19aa..7c7b05b5 100644
--- a/Week_01/id_19/NOTE.md
+++ b/Week_01/id_19/NOTE.md
@@ -1,3 +1,5 @@
 # 学习笔记
 
 week_01
+
+本周主要是学习了[线性表数据结构](http://note.youdao.com/noteshare?id=1a02479cdcbb9ffc7bb6dc587cbee0fc)。学习中基础知识发现都懂了，但在刷题时却没什么思路，最后回想起覃超老师传授的五毒神掌法及常见算法解题步骤一步步实践、反复练习及总结。
diff --git "a/Week_01/id_19/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225\346\200\235\347\273\264\345\257\274\345\233\276.png" "b/Week_01/id_19/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225\346\200\235\347\273\264\345\257\274\345\233\276.png"
new file mode 100644
index 00000000..3a248188
Binary files /dev/null and "b/Week_01/id_19/\346\225\260\346\215\256\347\273\223\346\236\204\344\270\216\347\256\227\346\263\225\346\200\235\347\273\264\345\257\274\345\233\276.png" differ