添加文档

Author: ssjssh

src/ssj/clrs/README.md

@@ -0,0 +1 @@
+算法导论里面的习题

src/ssj/divide_conquer/find_max_sublist_without_ recursion.py

@@ -2,12 +2,11 @@
 # -*- coding:UTF-8
 
 import sys
+from ssj.lib.stack import Stack
 
 reload(sys)
 sys.setdefaultencoding('UTF-8')
 
-from ssj.lib import queue
-from ssj.lib import Stack
 
 __author__ = 'shenshijun'
 

src/ssj/dynamic/README.md

@@ -1,6 +1,6 @@
 #!/usr/bin/env python
 # -*- coding:UTF-8
-from ssj.lib import Queue
+from ssj.lib.queue import Queue
 
 __author__ = 'shenshijun'
 """

src/ssj/graph/README.md

@@ -0,0 +1,31 @@
+#!/usr/bin/env python
+# -*- coding:UTF-8
+__author__ = 'shenshijun'
+"""
+'.' Matches any single character.
+'*' Matches zero or more of the preceding element.
+
+The matching should cover the entire input string (not partial).
+
+The function prototype should be:
+bool isMatch(const char *s, const char *p)
+
+Some examples:
+isMatch("aa","a") → false
+isMatch("aa","aa") → true
+isMatch("aaa","aa") → false
+isMatch("aa", "a*") → true
+isMatch("aa", ".*") → true
+isMatch("ab", ".*") → true
+isMatch("aab", "c*a*b") → true
+"""
+
+
+class Solution(object):
+    def isMatch(self, s, p):
+        """
+        :type s: str
+        :type p: str
+        :rtype: bool
+        """
+        pass