第一题，第二题

Author: changhongyuan

.idea/.gitignore

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module org.jetbrains.idea.maven.project.MavenProjectsManager.isMavenModule="true" type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" LANGUAGE_LEVEL="JDK_1_5">
+    <output url="file://$MODULE_DIR$/target/classes" />
+    <output-test url="file://$MODULE_DIR$/target/test-classes" />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src/main/java" isTestSource="false" />
+      <excludeFolder url="file://$MODULE_DIR$/target" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

.idea/compiler.xml

@@ -1,4 +1,4 @@
-package com.shuzijun.leetcode;
+package com.changhongyuan.leetcode;
 
 /**
  * Created with IntelliJ IDEA.

.idea/jarRepositories.xml

@@ -1,4 +1,4 @@
-package com.shuzijun.leetcode;
+package com.changhongyuan.leetcode;
 
 /**
 
@@ -11,6 +11,11 @@ public ListNode(int x) {
         val = x;
     }
 
+    public ListNode(int x, ListNode next) {
+        val = x;
+        this.next = next;
+    }
+
     @Override
     public String toString() {
         final StringBuilder sb = new StringBuilder().append(val);

.idea/leetcode/editor.xml

@@ -0,0 +1,29 @@
+package com.changhongyuan.leetcode.editor.cn;//给定一个整数数组 nums 和一个目标值 target，请你在该数组中找出和为目标值的那 两个 整数，并返回他们的数组下标。
+//
+// 你可以假设每种输入只会对应一个答案。但是，数组中同一个元素不能使用两遍。 
+//
+// 
+//
+// 示例: 
+//
+// 给定 nums = [2, 7, 11, 15], target = 9
+//
+//因为 nums[0] + nums[1] = 2 + 7 = 9
+//所以返回 [0, 1]
+// 
+// Related Topics 数组 哈希表 
+// 👍 9822 👎 0
+
+
+//leetcode submit region begin(Prohibit modification and deletion)
+class Solution {
+    public int[] twoSum(int[] nums, int target) {
+        for (int i = 0; i < nums.length; i++) {
+            for (int j = i + 1; j < nums.length; j++) {
+                if (nums[i] + nums[j] == target) return new int[]{i, j};
+            }
+        }
+        return null;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)

.idea/misc.xml

@@ -0,0 +1,70 @@
+//给出两个 非空 的链表用来表示两个非负的整数。其中，它们各自的位数是按照 逆序 的方式存储的，并且它们的每个节点只能存储 一位 数字。 
+//
+// 如果，我们将这两个数相加起来，则会返回一个新的链表来表示它们的和。 
+//
+// 您可以假设除了数字 0 之外，这两个数都不会以 0 开头。 
+//
+// 示例： 
+//
+// 输入：(2 -> 4 -> 3) + (5 -> 6 -> 4)
+//输出：7 -> 0 -> 8
+//原因：342 + 465 = 807
+// 
+// Related Topics 链表 数学 
+// 👍 5378 👎 0
+
+package com.changhongyuan.leetcode.editor.cn;
+
+import com.changhongyuan.leetcode.ListNode;
+
+class AddTwoNumbers{
+    //leetcode submit region begin(Prohibit modification and deletion)
+/**
+ * Definition for singly-linked list.
+ * public class ListNode {
+ *     int val;
+ *     ListNode next;
+ *     ListNode() {}
+ *     ListNode(int val) { this.val = val; }
+ *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
+ * }
+ */
+class Solution {
+    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
+//        ListNode result = new ListNode(0);
+        return doCal(l1, l2, 0);
+    }
+
+    public ListNode doCal(ListNode l1, ListNode l2, int in) {
+        if (null == l1 && null == l2 && in == 0) {
+            return null;
+        }
+        int n1 = null != l1 ? l1.val : 0;
+        int n2 = null != l2 ? l2.val : 0;
+        int sum = n1 + n2 + in;
+        ListNode result = new ListNode(sum % 10);
+        result.next = doCal(null != l1 ? l1.next : null, null != l2 ? l2.next : null, sum / 10);
+        return result;
+    }
+}
+//leetcode submit region end(Prohibit modification and deletion)
+
+    public static void main(String[] args) {
+        Solution solution = new AddTwoNumbers().new Solution();
+//        ListNode l1 = new ListNode(9);
+//        l1.next = new ListNode(9);
+//        l1.next.next = new ListNode(9);
+//        ListNode l2 = new ListNode(5);
+//        l2.next = new ListNode(6);
+//        l2.next.next = new ListNode(4);
+//        ListNode result = solution.addTwoNumbers(l1, l2);
+//        System.out.println(result);
+        ListNode l1 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9)))))));
+        ListNode l2 = new ListNode(9, new ListNode(9, new ListNode(9, new ListNode(9))));
+        System.out.println("l1 is " + l1);
+        System.out.println("l2 is " + l2);
+        ListNode result = solution.addTwoNumbers(l1, l2);
+        System.out.println(result);
+
+    }
+}

.idea/modules.xml

@@ -0,0 +1,42 @@
+//给出一个 32 位的有符号整数，你需要将这个整数中每位上的数字进行反转。 
+//
+// 示例 1: 
+//
+// 输入: 123
+//输出: 321
+// 
+//
+// 示例 2: 
+//
+// 输入: -123
+//输出: -321
+// 
+//
+// 示例 3: 
+//
+// 输入: 120
+//输出: 21
+// 
+//
+// 注意: 
+//
+// 假设我们的环境只能存储得下 32 位的有符号整数，则其数值范围为 [−231, 231 − 1]。请根据这个假设，如果反转后整数溢出那么就返回 0。 
+// Related Topics 数学 
+// 👍 2396 👎 0
+
+package com.changhongyuan.leetcode.editor.cn;
+class ReverseInteger{
+    //leetcode submit region begin(Prohibit modification and deletion)
+    class Solution {
+        public int reverse(int x) {
+            int result = 0;
+            return result;
+        }
+    }
+//leetcode submit region end(Prohibit modification and deletion)
+
+    public static void main(String[] args) {
+        Solution solution = new ReverseInteger().new Solution();
+        System.out.println();
+    }
+}

.idea/vcs.xml

@@ -11,9 +11,9 @@
 // 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
-import com.shuzijun.leetcode.ListNode;
+import com.changhongyuan.leetcode.ListNode;
 
 public class AddTwoNumbers {
     public static void main(String[] args) {

leetcode-question.iml

@@ -17,7 +17,7 @@
 //Output: 49 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 public class ContainerWithMostWater {
     public static void main(String[] args) {

src/main/java/com/shuzijun/leetcode/HelloWorld.java renamed to src/main/java/com/changhongyuan/leetcode/HelloWorld.java

@@ -15,7 +15,7 @@
 //]
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 import java.util.ArrayList;
 import java.util.List;

src/main/java/com/shuzijun/leetcode/ListNode.java renamed to src/main/java/com/changhongyuan/leetcode/ListNode.java

@@ -28,7 +28,7 @@
 // Coud you solve it without converting the integer to a string? 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 public class PalindromeNumber {
     public static void main(String[] args) {

src/main/java/com/changhongyuan/leetcode/editor/cn/[1]两数之和.java

@@ -25,7 +25,7 @@
 //Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows. 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 public class ReverseInteger {
     public static void main(String[] args) {

src/main/java/com/changhongyuan/leetcode/editor/cn/[2]两数相加.java

@@ -22,7 +22,7 @@
 //Output: -1 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 public class SearchInRotatedSortedArray {
     public static void main(String[] args) {

src/main/java/com/changhongyuan/leetcode/editor/cn/[7]整数反转.java

@@ -56,7 +56,7 @@
 //             Thefore INT_MIN (−231) is returned. 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 public class StringToIntegerAtoi {
     public static void main(String[] args) {

src/main/java/com/changhongyuan/leetcode/editor/cn/all.json

@@ -11,9 +11,9 @@
 // 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
-import com.shuzijun.leetcode.ListNode;
+import com.changhongyuan.leetcode.ListNode;
 
 public class SwapNodesInPairs {
     public static void main(String[] args) {

src/main/java/com/changhongyuan/leetcode/editor/cn/translation.json

@@ -17,7 +17,7 @@
 // 
 //
 
-package com.shuzijun.leetcode.editor.en;
+package com.changhongyuan.leetcode.editor.en;
 
 import java.util.ArrayList;
 import java.util.Arrays;