move drafts

ted12214 · ted12214 · commit 293fbebdead5 · 2019-07-20T17:26:03.000+08:00
diff --git a/_drafts/2019-05-06-arts_week_5.md b/_drafts/2019-05-06-arts_week_5.md
@@ -0,0 +1,62 @@
+---
+title: ARTS(第5周)
+category: ARTS
+tags:  arts
+---
+
+> **本周提纲：**
+>
+> 1. Algorithm: 最长公共前缀
+> 2. Review: 一个谷歌工程师编码解决问题的过程
+> 3. Tip: Jenkins REST API 触发任务执行
+> 4. Share: 关于负载均衡的一切(58沈剑)
+
+<!-- more -->
+
+## Algorithm
+
+[14.最长公共前缀](https://leetcode-cn.com/problems/longest-common-prefix/)
+
+### 描述
+
+> 编写一个函数来查找字符串数组中的最长公共前缀。
+>
+> 如果不存在公共前缀，返回空字符串 ""。  
+> 示例 1:  
+>
+> 输入: ["flower","flow","flight"]  
+> 输出: "fl"  
+>
+> 示例 2:
+>
+> 输入: ["dog","racecar","car"]
+> 输出: ""
+> 解释: 输入不存在公共前缀。
+> 说明:
+>
+> 所有输入只包含小写字母 a-z 。
+
+### 代码
+
+```python
+class Solution:
+    def longestCommonPrefix(self, strs: List[str]) -> str:
+        """
+        :type strs :List[str]
+        :rtype str
+        """
+        if len(strs) == 0: return ""
+        # 按照字母表顺序获取最大值和最小值（进行了简单的排序）
+        s1, s2 = min(strs), max(strs)
+        zobj = zip(s1,s2)
+        rstr = ""
+        for i,j in list(zobj):
+            if i != j:
+                return rstr
+            rstr += i
+        return rstr
+```
+
+## Review
+
+[rework](https://rework.withgoogle.com/print/guides/5721312655835136/)
diff --git a/_drafts/oodesign/chain-of-responsibility.md b/_drafts/oodesign/chain-of-responsibility.md
@@ -40,8 +40,8 @@ comments: true
 
 ```java
 public class Request {	
-	private int m_value;
-	private String m_description;
+    private int m_value;
+    private String m_description;
 
 	public Request(String description, int value)
 	{

Original file line number	Diff line number	Diff line change
`@@ -40,8 +40,8 @@ comments: true`
`40`	`40`
`41`	`41`	```java
`42`	`42`	`public class Request {`
`43`		`- private int m_value;`
`44`		`- private String m_description;`
	`43`	`+ private int m_value;`
	`44`	`+ private String m_description;`
`45`	`45`
`46`	`46`	`public Request(String description, int value)`
`47`	`47`	`{`