add problem descriptions

fishercoder1534 · fishercoder1534 · commit a3f638aeb7c5 · 2016-12-07T11:03:23.000-08:00
diff --git a/Database/Duplicate-Emails.sql b/Database/Duplicate-Emails.sql
diff --git a/EASY/src/easy/ClosestBinarySearchTreeValue.java b/EASY/src/easy/ClosestBinarySearchTreeValue.java
@@ -1,7 +1,11 @@
 package easy;
 
 import classes.TreeNode;
+/**Given a non-empty binary search tree and a target value, find the value in the BST that is closest to the target.
 
+ Note:
+ Given target value is a floating point.
+ You are guaranteed to have only one unique value in the BST that is closest to the target.*/
 public class ClosestBinarySearchTreeValue {
     
     class General_tree_solution {
diff --git a/EASY/src/easy/CompareVersionNumbers.java b/EASY/src/easy/CompareVersionNumbers.java
@@ -1,4 +1,14 @@
 package easy;
+/**Compare two version numbers version1 and version2.
+ If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.
+
+ You may assume that the version strings are non-empty and contain only digits and the . character.
+ The . character does not represent a decimal point and is used to separate number sequences.
+ For instance, 2.5 is not "two and a half" or "half way to version three", it is the fifth second-level revision of the second first-level revision.
+
+ Here is an example of version numbers ordering:
+
+ 0.1 < 1.1 < 1.2 < 13.37*/
 
 public class CompareVersionNumbers {
 
diff --git a/EASY/src/easy/ContainsDuplicate.java b/EASY/src/easy/ContainsDuplicate.java
@@ -4,8 +4,8 @@
 import java.util.Set;
 
 /**
- * 217. Contains Duplicate QuestionEditorial Solution My Submissions Total Accepted: 106831 Total
- * Submissions: 252115 Difficulty: Easy Given an array of integers, find if the array contains any
+ * 217. Contains Duplicate
+ * Given an array of integers, find if the array contains any
  * duplicates. Your function should return true if any value appears at least twice in the array,
  * and it should return false if every element is distinct.
  */
diff --git a/EASY/src/easy/ContainsDuplicateII.java b/EASY/src/easy/ContainsDuplicateII.java
@@ -3,10 +3,8 @@
 import java.util.HashMap;
 import java.util.Map;
 
-/**219. Contains Duplicate II  QuestionEditorial Solution  My Submissions
-Total Accepted: 69920
-Total Submissions: 228733
-Difficulty: Easy
+/**219. Contains Duplicate II
+ *
 Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.*/
 public class ContainsDuplicateII {
     //pretty straightforward, use a hashmap, key is the number itself, value is the last index that this value appeared in the array
diff --git a/EASY/src/easy/CountandSay.java b/EASY/src/easy/CountandSay.java
@@ -1,7 +1,15 @@
 package easy;
 
 public class CountandSay {
+/**The count-and-say sequence is the sequence of integers beginning as follows:
+ 1, 11, 21, 1211, 111221, ...
 
+ 1 is read off as "one 1" or 11.
+ 11 is read off as "two 1s" or 21.
+ 21 is read off as "one 2, then one 1" or 1211.
+ Given an integer n, generate the nth sequence.
+
+ Note: The sequence of integers will be represented as a string.*/
     public String countAndSay(int n) {
         StringBuilder curr = new StringBuilder("1");
         StringBuilder prev;
diff --git a/EASY/src/easy/DeleteNodeInALinkedList.java b/EASY/src/easy/DeleteNodeInALinkedList.java
@@ -2,17 +2,11 @@
 
 import classes.ListNode;
 
-/**237. Delete Node in a Linked List  QuestionEditorial Solution  My Submissions
-Total Accepted: 96741
-Total Submissions: 218247
-Difficulty: Easy
+/**237. Delete Node in a Linked List
+ *
 Write a function to delete a node (except the tail) in a singly linked list, given only access to that node.
 
 Supposed the linked list is 1 -> 2 -> 3 -> 4 and you are given the third node with value 3, the linked list should become 1 -> 2 -> 4 after calling your function.
-
-Hide Company Tags Adobe Apple Microsoft
-Hide Tags Linked List
-Hide Similar Problems (E) Remove Linked List Elements
 */
 public class DeleteNodeInALinkedList {
 
diff --git a/README.md b/README.md
@@ -73,9 +73,11 @@
 |249|[Group Shifted Strings](https://leetcode.com/problems/group-shifted-strings/)|[Solution](../../blob/master/EASY/src/easy/GroupShiftedStrings.java) | O(nlogn) | O(n) | 
 |246|[Strobogrammatic Number](https://leetcode.com/problems/strobogrammatic-number/)|[Solution](../../blob/master/EASY/src/easy/StrobogrammaticNumber.java) | O(n) | O(1) | 
 |243|[Shortest Word Distance](https://leetcode.com/problems/shortest-word-distance/)|[Solution](../../blob/master/EASY/src/easy/ShortestWordDistance.java) | O(n) | O(1) | 
+|237|[Delete Node in a Linked List](https://leetcode.com/problems/delete-node-in-a-linked-list/)|[Solution](../../blob/master/EASY/src/easy/DeleteNodeInALinkedList.java)| O(1)|O(1) | Easy| LinkedList
 |226|[Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree/)|[Solution](../../blob/master/EASY/src/easy/InvertBinaryTree.java)| O(n)|O(h) | Easy| DFS, recursion
 |223|[Rectangle Area](https://leetcode.com/problems/rectangle-area/)|[Solution](../../blob/master/EASY/src/easy/RectangleArea.java)| O(1)|O(1) | Easy| 
 |219|[Contains Duplicate II](https://leetcode.com/problems/contains-duplicate-ii/)|[Solution](../../blob/master/EASY/src/easy/ContainsDuplicateII.java)| O(n)|O(n) | Easy| HashMap
+|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)|[Solution](../../blob/master/EASY/src/easy/ContainsDuplicate.java)| O(n)|O(n) | Easy| HashSet
 |209|[Minimum Size Subarray Sum](https://leetcode.com/problems/minimum-size-subarray-sum/)|[Solution](../../blob/master/MEDIUM/src/medium/MinimumSizeSubarraySum.java)| O(n)|O(1) | Medium|
 |208|[Implement Trie](https://leetcode.com/problems/implement-trie-prefix-tree/)|[Solution](../../blob/master/MEDIUM/src/medium/ImplementTrie.java)| O(n)|O(1) | Medium|
 |206|[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)|[Solution](../../blob/master/EASY/src/easy/ReverseLinkedList.java)| O(n)|O(1) | Easy
@@ -128,6 +130,7 @@
 |47|[Permutations II](https://leetcode.com/problems/permutations-ii/)|[Solution](../../blob/master/MEDIUM/src/medium/PermutationsII.java)|O(n*n!)|O(n)|Medium|Backtracking
 |43|[Multiply Strings](https://leetcode.com/problems/multiply-strings/)|[Solution]|||Medium
 |39|[Combination Sum](https://leetcode.com/problems/combination-sum/)|[Solution](../../blob/master/MEDIUM/src/medium/CombinationSum.java)|O(k*n^k)|O(k)|Medium|Backtracking
+|38|[Count and Say](https://leetcode.com/problems/count-and-say/)|[Solution](../../blob/master/EASY/src/easy/CountandSay.java)|O(n*2^n)|O(2^n)|Easy| Recursion, LinkedList
 |34|[Search for a Range](https://leetcode.com/problems/search-for-a-range/)|[Solution](../../blob/master/MEDIUM/src/medium/SearchForARange.java)|O(logn)|O(1)|Medium|Array, Binary Search
 |31|[Next Permutation](https://leetcode.com/problems/next-permutation)|[Solution](../../blob/master/MEDIUM/src/medium/NextPermutation.java)|O(n)|O(1)|Medium|Array
 |24|[Swap Nodes in Pairs](https://leetcode.com/problems/swap-nodes-in-pairs/)|[Solution](../../blob/master/EASY/src/easy/SwapNodesinPairs.java)|O(n)|O(1)|Easy| Recursion, LinkedList
