clean up 236

fishercoder1534 · fishercoder1534 · commit b6d18b85de30 · 2019-01-22T18:38:12.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_236.java b/src/main/java/com/fishercoder/solutions/_236.java
@@ -24,14 +24,6 @@ For example, the lowest common ancestor (LCA) of nodes 5 and 1 is 3.
 public class _236 {
     public static class Solution1 {
 
-        /**
-         * We need to find TWO nodes in the tree,
-         * so we'll have to divide and conquer this tree,
-         * we need to have two nodes to as the intermediate result,
-         * also, refer to my earlier drawings:http://www.fishercoder.com/2016/06/23/lowest-common-ancestor-of-a-binary-tree/
-         * I'm really impressed with myself at that time!
-         */
-
         public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
             if (root == null || root == p || root == q) {
                 return root;
