JavaSheng
diff --git a/‎.idea/.name
Lines changed: 1 addition & 0 deletions b/‎.idea/.name
Lines changed: 1 addition & 0 deletions
diff --git a/‎.idea/compiler.xml
Lines changed: 22 additions & 0 deletions b/‎.idea/compiler.xml
Lines changed: 22 additions & 0 deletions
diff --git a/‎.idea/copyright/profiles_settings.xml
Lines changed: 3 additions & 0 deletions b/‎.idea/copyright/profiles_settings.xml
Lines changed: 3 additions & 0 deletions
diff --git a/‎.idea/misc.xml
Lines changed: 19 additions & 0 deletions b/‎.idea/misc.xml
Lines changed: 19 additions & 0 deletions
diff --git a/‎.idea/modules.xml
Lines changed: 87 additions & 0 deletions b/‎.idea/modules.xml
Lines changed: 87 additions & 0 deletions
diff --git a/‎.idea/uiDesigner.xml
Lines changed: 124 additions & 0 deletions b/‎.idea/uiDesigner.xml
Lines changed: 124 additions & 0 deletions
diff --git a/‎.idea/vcs.xml
Lines changed: 6 additions & 0 deletions b/‎.idea/vcs.xml
Lines changed: 6 additions & 0 deletions
diff --git a/‎out/production/【001】【TwoSum】/Main.class
847 Bytes b/‎out/production/【001】【TwoSum】/Main.class
847 Bytes
diff --git a/‎out/production/【001】【TwoSum】/Solution$Node.class
837 Bytes b/‎out/production/【001】【TwoSum】/Solution$Node.class
837 Bytes
diff --git a/‎out/production/【001】【TwoSum】/Solution.class
979 Bytes b/‎out/production/【001】【TwoSum】/Solution.class
979 Bytes
diff --git a/‎out/production/【005】【LongestPalindromicSubstringTotal 】/Main.class
649 Bytes b/‎out/production/【005】【LongestPalindromicSubstringTotal 】/Main.class
649 Bytes
diff --git a/‎out/production/【005】【LongestPalindromicSubstringTotal 】/Solution.class
1.67 KB b/‎out/production/【005】【LongestPalindromicSubstringTotal 】/Solution.class
1.67 KB
diff --git a/‎out/production/【005】【LongestValidParentheses】/Main.class
715 Bytes b/‎out/production/【005】【LongestValidParentheses】/Main.class
715 Bytes
diff --git a/‎out/production/【005】【LongestValidParentheses】/Solution.class
1.29 KB b/‎out/production/【005】【LongestValidParentheses】/Solution.class
1.29 KB
diff --git a/‎out/production/【010】【RegularExpressionMatching】/Main.class
630 Bytes b/‎out/production/【010】【RegularExpressionMatching】/Main.class
630 Bytes
diff --git a/‎out/production/【010】【RegularExpressionMatching】/Solution.class
992 Bytes b/‎out/production/【010】【RegularExpressionMatching】/Solution.class
992 Bytes
diff --git a/‎out/production/【013】【3Sum】/Main.class
666 Bytes b/‎out/production/【013】【3Sum】/Main.class
666 Bytes
diff --git a/‎out/production/【013】【3Sum】/Solution.class
1.76 KB b/‎out/production/【013】【3Sum】/Solution.class
1.76 KB
diff --git a/‎out/production/【016】【3SumClosest】/Main.class
601 Bytes b/‎out/production/【016】【3SumClosest】/Main.class
601 Bytes
diff --git a/‎out/production/【016】【3SumClosest】/Solution.class
927 Bytes b/‎out/production/【016】【3SumClosest】/Solution.class
927 Bytes
diff --git a/‎out/production/【022】【GenerateParentheses】/Main.class
695 Bytes b/‎out/production/【022】【GenerateParentheses】/Main.class
695 Bytes
diff --git a/‎out/production/【022】【GenerateParentheses】/Solution.class
1.13 KB b/‎out/production/【022】【GenerateParentheses】/Solution.class
1.13 KB
diff --git a/‎out/production/【025】【ReverseNodesInK-Group】/ListNode.class
326 Bytes b/‎out/production/【025】【ReverseNodesInK-Group】/ListNode.class
326 Bytes
diff --git a/‎out/production/【025】【ReverseNodesInK-Group】/Main.class
1.4 KB b/‎out/production/【025】【ReverseNodesInK-Group】/Main.class
1.4 KB
diff --git a/‎out/production/【025】【ReverseNodesInK-Group】/Solution.class
874 Bytes b/‎out/production/【025】【ReverseNodesInK-Group】/Solution.class
874 Bytes
diff --git a/‎out/production/【029】【DivideTwoIntegers】/Main.class
589 Bytes b/‎out/production/【029】【DivideTwoIntegers】/Main.class
589 Bytes
diff --git a/‎out/production/【029】【DivideTwoIntegers】/Solution.class
1.14 KB b/‎out/production/【029】【DivideTwoIntegers】/Solution.class
1.14 KB
diff --git a/‎out/production/【064】【MinimumPathSum】/Main.class
4.62 KB b/‎out/production/【064】【MinimumPathSum】/Main.class
4.62 KB
diff --git a/‎out/production/【064】【MinimumPathSum】/Solution.class
878 Bytes b/‎out/production/【064】【MinimumPathSum】/Solution.class
878 Bytes
diff --git a/‎out/production/【079】【WordSearch】/Main.class
732 Bytes b/‎out/production/【079】【WordSearch】/Main.class
732 Bytes
diff --git a/‎out/production/【079】【WordSearch】/Solution.class
1.32 KB b/‎out/production/【079】【WordSearch】/Solution.class
1.32 KB
diff --git a/‎out/production/【081】【SearchInRotatedSortedArraII】/Main.class
596 Bytes b/‎out/production/【081】【SearchInRotatedSortedArraII】/Main.class
596 Bytes
diff --git a/‎out/production/【081】【SearchInRotatedSortedArraII】/Solution.class
1.49 KB b/‎out/production/【081】【SearchInRotatedSortedArraII】/Solution.class
1.49 KB
diff --git a/‎out/production/【089】【GrayCode】/Main.class
1.15 KB b/‎out/production/【089】【GrayCode】/Main.class
1.15 KB
diff --git a/‎out/production/【089】【GrayCode】/Solution.class
1003 Bytes b/‎out/production/【089】【GrayCode】/Solution.class
1003 Bytes
diff --git a/‎out/production/【094】【BinaryTree InorderTraversal】/Main.class
938 Bytes b/‎out/production/【094】【BinaryTree InorderTraversal】/Main.class
938 Bytes
diff --git a/‎out/production/【094】【BinaryTree InorderTraversal】/Solution.class
1.3 KB b/‎out/production/【094】【BinaryTree InorderTraversal】/Solution.class
1.3 KB
diff --git a/‎out/production/【094】【BinaryTree InorderTraversal】/TreeNode.class
342 Bytes b/‎out/production/【094】【BinaryTree InorderTraversal】/TreeNode.class
342 Bytes
diff --git a/‎out/production/【096】【UniqueBinarySearchTrees】/Main.class
637 Bytes b/‎out/production/【096】【UniqueBinarySearchTrees】/Main.class
637 Bytes
diff --git a/‎out/production/【096】【UniqueBinarySearchTrees】/Solution.class
581 Bytes b/‎out/production/【096】【UniqueBinarySearchTrees】/Solution.class
581 Bytes
diff --git a/‎out/production/【103】【BinaryTreeZigzagLevelOrderTraversal】/Main.class
834 Bytes b/‎out/production/【103】【BinaryTreeZigzagLevelOrderTraversal】/Main.class
834 Bytes
diff --git a/‎out/production/【103】【BinaryTreeZigzagLevelOrderTraversal】/Solution.class
2.11 KB b/‎out/production/【103】【BinaryTreeZigzagLevelOrderTraversal】/Solution.class
2.11 KB
diff --git a/‎out/production/【103】【BinaryTreeZigzagLevelOrderTraversal】/TreeNode.class
342 Bytes b/‎out/production/【103】【BinaryTreeZigzagLevelOrderTraversal】/TreeNode.class
342 Bytes
diff --git a/‎out/production/【106】【ConstructBinaryTreeFromInorderAndPostorderTraversal】/Main.class
1.14 KB b/‎out/production/【106】【ConstructBinaryTreeFromInorderAndPostorderTraversal】/Main.class
1.14 KB
diff --git a/‎out/production/【106】【ConstructBinaryTreeFromInorderAndPostorderTraversal】/Solution.class
1.05 KB b/‎out/production/【106】【ConstructBinaryTreeFromInorderAndPostorderTraversal】/Solution.class
1.05 KB
diff --git a/‎out/production/【106】【ConstructBinaryTreeFromInorderAndPostorderTraversal】/TreeNode.class
342 Bytes b/‎out/production/【106】【ConstructBinaryTreeFromInorderAndPostorderTraversal】/TreeNode.class
342 Bytes
diff --git a/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/ListNode.class
326 Bytes b/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/ListNode.class
326 Bytes
diff --git a/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/Main.class
1.93 KB b/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/Main.class
1.93 KB
diff --git a/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/Solution.class
807 Bytes b/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/Solution.class
807 Bytes
diff --git a/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/TreeNode.class
342 Bytes b/‎out/production/【109】【ConvertSortedListToBinarySearchTree】/TreeNode.class
342 Bytes
diff --git a/‎out/production/【117】【PopulatingNextRightPointersInEachNodeII】/Main.class
1.22 KB b/‎out/production/【117】【PopulatingNextRightPointersInEachNodeII】/Main.class
1.22 KB
diff --git a/‎out/production/【117】【PopulatingNextRightPointersInEachNodeII】/Solution.class
1.51 KB b/‎out/production/【117】【PopulatingNextRightPointersInEachNodeII】/Solution.class
1.51 KB
diff --git a/‎out/production/【117】【PopulatingNextRightPointersInEachNodeII】/TreeLinkNode.class
369 Bytes b/‎out/production/【117】【PopulatingNextRightPointersInEachNodeII】/TreeLinkNode.class
369 Bytes
diff --git a/‎out/production/【120】【Triangle】/Main.class
1.29 KB b/‎out/production/【120】【Triangle】/Main.class
1.29 KB
diff --git a/‎out/production/【120】【Triangle】/Solution.class
1.35 KB b/‎out/production/【120】【Triangle】/Solution.class
1.35 KB
diff --git a/‎out/production/【130】【SurroundedRegions】/Main.class
1.7 KB b/‎out/production/【130】【SurroundedRegions】/Main.class
1.7 KB
diff --git a/‎out/production/【130】【SurroundedRegions】/Solution$Coordinate.class
976 Bytes b/‎out/production/【130】【SurroundedRegions】/Solution$Coordinate.class
976 Bytes
diff --git a/‎out/production/【130】【SurroundedRegions】/Solution.class
3.72 KB b/‎out/production/【130】【SurroundedRegions】/Solution.class
3.72 KB
diff --git a/‎out/production/【138】【CopyListWithRandomPointer】/Main.class
1.27 KB b/‎out/production/【138】【CopyListWithRandomPointer】/Main.class
1.27 KB
diff --git a/‎out/production/【138】【CopyListWithRandomPointer】/RandomListNode.class
363 Bytes b/‎out/production/【138】【CopyListWithRandomPointer】/RandomListNode.class
363 Bytes
diff --git a/‎out/production/【138】【CopyListWithRandomPointer】/Solution.class
1.18 KB b/‎out/production/【138】【CopyListWithRandomPointer】/Solution.class
1.18 KB
diff --git a/‎out/production/【139】【WordBreak】/Main.class
1.59 KB b/‎out/production/【139】【WordBreak】/Main.class
1.59 KB
diff --git a/‎out/production/【139】【WordBreak】/Solution.class
2.5 KB b/‎out/production/【139】【WordBreak】/Solution.class
2.5 KB
diff --git a/‎out/production/【150】【EvaluateReversePolishNotation】/Main.class
655 Bytes b/‎out/production/【150】【EvaluateReversePolishNotation】/Main.class
655 Bytes
diff --git a/‎out/production/【150】【EvaluateReversePolishNotation】/Solution.class
1.4 KB b/‎out/production/【150】【EvaluateReversePolishNotation】/Solution.class
1.4 KB
diff --git a/‎out/production/【151】【ReverseWordsInAString】/Main.class
722 Bytes b/‎out/production/【151】【ReverseWordsInAString】/Main.class
722 Bytes
diff --git a/‎out/production/【151】【ReverseWordsInAString】/Solution.class
1.7 KB b/‎out/production/【151】【ReverseWordsInAString】/Solution.class
1.7 KB
diff --git a/‎out/production/【152】【FindMinimumInRotatedSortedArray】/Main.class
681 Bytes b/‎out/production/【152】【FindMinimumInRotatedSortedArray】/Main.class
681 Bytes
diff --git a/‎out/production/【152】【FindMinimumInRotatedSortedArray】/Solution.class
717 Bytes b/‎out/production/【152】【FindMinimumInRotatedSortedArray】/Solution.class
717 Bytes
diff --git a/‎out/production/【152】【MaximumProductSubarray】/Main.class
594 Bytes b/‎out/production/【152】【MaximumProductSubarray】/Main.class
594 Bytes
diff --git a/‎out/production/【152】【MaximumProductSubarray】/Solution.class
769 Bytes b/‎out/production/【152】【MaximumProductSubarray】/Solution.class
769 Bytes
diff --git a/‎out/production/【154】【FindMinimumInRotatedSortedArrayII】/Main.class
591 Bytes b/‎out/production/【154】【FindMinimumInRotatedSortedArrayII】/Main.class
591 Bytes
diff --git a/‎out/production/【154】【FindMinimumInRotatedSortedArrayII】/Solution.class
886 Bytes b/‎out/production/【154】【FindMinimumInRotatedSortedArrayII】/Solution.class
886 Bytes
diff --git a/‎out/production/【191】【NumberOf1Bits】/Main.class
588 Bytes b/‎out/production/【191】【NumberOf1Bits】/Main.class
588 Bytes
diff --git a/‎out/production/【191】【NumberOf1Bits】/Solution.class
429 Bytes b/‎out/production/【191】【NumberOf1Bits】/Solution.class
429 Bytes
diff --git a/‎out/production/【198】【HouseRobber】/Main.class
631 Bytes b/‎out/production/【198】【HouseRobber】/Main.class
631 Bytes
diff --git a/‎out/production/【198】【HouseRobber】/Solution.class
584 Bytes b/‎out/production/【198】【HouseRobber】/Solution.class
584 Bytes
diff --git a/‎out/production/【202】【HappyNumber 】/Solution.class
1.24 KB b/‎out/production/【202】【HappyNumber 】/Solution.class
1.24 KB
diff --git a/‎out/production/【215】【KthLargestElementInAnArray】/Main.class
596 Bytes b/‎out/production/【215】【KthLargestElementInAnArray】/Main.class
596 Bytes
diff --git a/‎out/production/【215】【KthLargestElementInAnArray】/Solution.class
1.46 KB b/‎out/production/【215】【KthLargestElementInAnArray】/Solution.class
1.46 KB
diff --git a/‎out/production/【216】【CombinationSumIII】/Main.class
620 Bytes b/‎out/production/【216】【CombinationSumIII】/Main.class
620 Bytes
diff --git a/‎out/production/【216】【CombinationSumIII】/Solution.class
1.78 KB b/‎out/production/【216】【CombinationSumIII】/Solution.class
1.78 KB
diff --git a/‎out/production/【217】【ContainsDuplicate 】/Main.class
674 Bytes b/‎out/production/【217】【ContainsDuplicate 】/Main.class
674 Bytes
diff --git a/‎out/production/【217】【ContainsDuplicate 】/Solution.class
854 Bytes b/‎out/production/【217】【ContainsDuplicate 】/Solution.class
854 Bytes
diff --git a/‎out/production/【223】【RectangleArea】/Main.class
618 Bytes b/‎out/production/【223】【RectangleArea】/Main.class
618 Bytes
diff --git a/‎out/production/【223】【RectangleArea】/Solution.class
1.03 KB b/‎out/production/【223】【RectangleArea】/Solution.class
1.03 KB
diff --git a/‎【001】【TwoSum】/src/Main.java
Lines changed: 13 additions & 0 deletions b/‎【001】【TwoSum】/src/Main.java
Lines changed: 13 additions & 0 deletions
diff --git a/‎【001】【TwoSum】/src/Solution.java
Lines changed: 92 additions & 0 deletions b/‎【001】【TwoSum】/src/Solution.java
Lines changed: 92 additions & 0 deletions
diff --git a/‎【001】【TwoSum】/【001】【TwoSum】.iml
Lines changed: 11 additions & 0 deletions b/‎【001】【TwoSum】/【001】【TwoSum】.iml
Lines changed: 11 additions & 0 deletions
diff --git a/‎【002】【AddTwoNumbers】/src/ListNode.java
Lines changed: 14 additions & 0 deletions b/‎【002】【AddTwoNumbers】/src/ListNode.java
Lines changed: 14 additions & 0 deletions
@@ -0,0 +1,13 @@
+/**
+ * Author: Íõ¿¡³¬
+ * Date: 2015-06-18
+ * Time: 09:17
+ * Declaration: All Rights Reserved !!!
+ */
+public class Main {
+    public static void main(String[] args) {
+        int[] result = new Solution().twoSum(new int[]{0, 4, 3, 0}, 0);
+
+        System.out.println("[" + result[0] + " ," + result[1] + "]");
+    }
+}
@@ -0,0 +1,92 @@
+import java.util.Arrays;
+
+/**
+ * Author: 王俊超
+ * Date: 2015-06-17
+ * Time: 20:27
+ * Declaration: All Rights Reserved !!!
+ */
+public class Solution {
+    private static class Node implements Comparable<Node> {
+        int val;
+        int idx;
+
+        public Node() {
+        }
+
+        public Node(int val, int idx) {
+            this.val = val;
+            this.idx = idx;
+        }
+
+        @Override
+        public int compareTo(Node o) {
+            if (o == null) {
+                return -1;
+            }
+            return this.val - o.val;
+        }
+    }
+
+
+    /**
+     * <pre>
+     * Given an array of integers, find two numbers such that they add up to a specific target number.
+     * The function twoSum should return indices of the two numbers such that they add up to the target,
+     * where index1 must be less than index2. Please note that your returned answers (both index1 and index2)
+     * are not zero-based.
+     * You may assume that each input would have exactly one solution.
+     *
+     * Input: numbers={2, 7, 11, 15}, target=9
+     * Output: index1=1, index2=2
+     *
+     * 题目大意
+     * 给定一个整数数组，找出其中两个数满足相加等于你指定的目标数字。
+     * 要求：这个函数twoSum必须要返回能够相加等于目标数字的两个数的索引，且index1必须要小于index2。
+     * 请注意一点，你返回的结果（包括index1和index2）都不是基于0开始的。你可以假设每一个输入肯定只有一个结果。
+     *
+     * 解题思路
+     * 创建一个辅助类数组，对辅助类进行排序，使用两个指针，开始时分别指向数组的两端，看这两个下标对应的值是否
+     * 等于目标值，如果等于就从辅助类中找出记录的下标，构造好返回结果，返回。如果大于就让右边的下标向左移，
+     * 进入下一次匹配，如果小于就让左边的下标向右移动，进入下一次匹配，直到所有的数据都处理完
+     * </pre>
+     *
+     * @param nums
+     * @param target
+     * @return
+     */
+
+    public int[] twoSum(int[] nums, int target) {
+        int[] result = {0, 0};
+
+        Node[] tmp = new Node[nums.length];
+        for (int i = 0; i < nums.length; i++) {
+            tmp[i] = new Node(nums[i], i);
+        }
+
+        Arrays.sort(tmp);
+
+        int lo = 0;
+        int hi = nums.length - 1;
+
+
+        while (lo < hi) {
+            if (tmp[lo].val + tmp[hi].val == target) {
+
+                if (tmp[lo].idx > tmp[hi].idx) {
+                    result[0] = tmp[hi].idx + 1;
+                    result[1] = tmp[lo].idx + 1;
+                } else {
+                    result[0] = tmp[lo].idx + 1;
+                    result[1] = tmp[hi].idx + 1;
+                }
+                break;
+            } else if (tmp[lo].val + tmp[hi].val > target) {
+                hi--;
+            } else {
+                lo++;
+            }
+        }
+        return result;
+    }
+}
@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
@@ -0,0 +1,14 @@
+/**
+ * Author: Íõ¿¡³¬
+ * Date: 2015-08-21
+ * Time: 16:05
+ * Declaration: All Rights Reserved !!!
+ */
+public class ListNode {
+    int val;
+    ListNode next;
+
+    ListNode(int val) {
+        this.val = val;
+    }
+}