rename

Author: fishercoder1534

README.md

@@ -361,6 +361,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_237.java)| O(1)|O(1) | Easy| LinkedList
 |236|[Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_236.java)| O(n)|O(h) | Medium| DFS
 |235|[Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_235.java)| O(h)|O(1) | Easy| DFS
+|234|[Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_234.java)| O(n)|O(1) | Easy| 
 |233|[Number of Digit One](https://leetcode.com/problems/number-of-digit-one/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NumberofDigitOne.java)| O(n)|O(1) | Hard| Math
 |232|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_232.java)| O(n)|O(n) | Medium| Stack, Design
 |231|[Power of Two](https://leetcode.com/problems/power-of-two/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_231.java)| O(1)|O(1) | Easy| 

src/main/java/com/fishercoder/solutions/LongestWordinDictionarythroughDeleting.java

@@ -9,7 +9,7 @@
 
  Follow up:
  Could you do it in O(n) time and O(1) space?*/
-public class PalindromeLinkedList {
+public class _234 {
     //then I turned to Discuss, and found that they actually reverse the half and then do the comparison, e.g. https://discuss.leetcode.com/topic/33376/java-easy-to-understand
     //a strong candidate would try to restore the reversed half before return to keep the input intact
     //practice does make perfect! Cheers! I implemented this code in 20 mins this time! Cheers!
@@ -77,7 +77,7 @@ public boolean isPalindrome(ListNode head) {
     }
 
     public static void main(String...strings){
-        PalindromeLinkedList test = new PalindromeLinkedList();
+        _234 test = new _234();
 //        ListNode head = new ListNode(1);
 //        head.next = new ListNode(2);
 //        head.next.next = new ListNode(3);