005

Author: codeyu

.gitignore

@@ -250,3 +250,4 @@ paket-files/
 # JetBrains Rider
 .idea/
 *.sln.iml
+xidel/

Algorithms/LongestPalindromicSubstring.cs

@@ -0,0 +1,21 @@
+// Source : https://leetcode.com/problems/longest-palindromic-substring/
+// Author : codeyu
+// Date   : 2016-09-22
+
+/*************************************************************************************** 
+ *
+ * Given a string S, find the longest palindromic substring in S. You may assume that 
+ * the maximum length of S is 1000, and there exists one unique longest palindromic 
+ * substring.
+ ***************************************************************************************/
+
+namespace Algorithms
+{
+    public class Solution005 
+    {
+        public static string LongestPalindromicSubstring(string s) 
+        {
+            return "";
+        }
+    }
+}

AlgorithmsTest/LongestPalindromicSubstringTest.cs

@@ -0,0 +1,16 @@
+using Algorithms;
+using Xunit;
+namespace AlgorithmsTest
+{
+    public class LongestPalindromicSubstringTest
+    {
+        [Theory]
+        [InlineData("XMADAMYX", "MADAM")]
+        [InlineData("bbba", "bbb")]
+        [InlineData("googlelevel", "level")]
+        public void Test_LongestPalindromicSubstring(string input, string output)
+        {
+            Assert.Equal(output,Solution005.LongestPalindromicSubstring(input));
+        }
+    }
+}

README.md

@@ -10,4 +10,5 @@ LeetCode
 |001|[Two Sum](https://leetcode.com/problems/two-sum/) | [C#](./Algorithms/TwoSum.cs)|Easy|
 |002|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/) | [C#](./Algorithms/AddTwoNumbers.cs)|Medium|
 |003|[Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [C#](./Algorithms/LengthOfLongestSubstring.cs)|Medium|
-|004|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [C#](./Algorithms/FindMedianSortedArrays.cs) |Hard|
+|004|[Median of Two Sorted Arrays](https://leetcode.com/problems/median-of-two-sorted-arrays/) | [C#](./Algorithms/FindMedianSortedArrays.cs) |Hard|
+|005|[Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [C#](./Algorithms/LongestPalindromicSubstring.cs)|Medium|

Scripts/README.md

@@ -58,7 +58,7 @@ The comments would be generated by above examples as below:
 For example:
 
 ```
-$  ./readme.sh ../algorithms/cpp/nextPermutation/nextPermutation.cpp 
-|31|[Next Permutation](https://oj.leetcode.com/problems/next-permutation/) | [C++](./algorithms/cpp/nextPermutation/nextPermutation.cpp)|Medium|
+$  ./readme.sh ../Algorithms/TwoSumTest.cs
+|001|[Two Sum](https://leetcode.com/problems/two-sum/) | [C#](./Algorithms/TwoSum.cs)|Easy|
 ```
 

Scripts/comments.sh

@@ -28,6 +28,6 @@ NUM=`echo ${title_str} | awk -F '.' '{print $1}'`
 TITLE=`echo ${title_str} | awk -F '.' '{print $2}' | sed -e 's/^[[:space:]]*//'`
 DIFFCULT=`xidel ${URL} -q -e "css('.question-info')" | grep Difficulty | awk '{print $2}'`
 
-FILE=`echo ${FILE} | sed "s/.*\/algorithms/\.\/algorithms/"`
+FILE=`echo ${FILE} | sed "s/.*\/Algorithms/\.\/Algorithms/"`
 
 echo "|${NUM}|[${TITLE}](${URL}) | [C#](${FILE})|${DIFFCULT}|"