20181027

Author: fay111101

src/main/java/leetcode/array/_11_MaxArea.java

@@ -0,0 +1,4 @@
+package leetcode.array;
+
+public class _11_MaxArea {
+}

…ode/array/BestTimeToBuyAndSellStock.java …rray/_121_BestTimeToBuyAndSellStock.javasrc/main/java/leetcode/array/BestTimeToBuyAndSellStock.java renamed to src/main/java/leetcode/array/_121_BestTimeToBuyAndSellStock.java src/main/java/leetcode/array/BestTimeToBuyAndSellStock.java renamed to src/main/java/leetcode/array/_121_BestTimeToBuyAndSellStock.java

@@ -7,6 +7,7 @@
  design an algorithm to find the maximum profit.
 */
 public class BestTimeToBuyAndSellStock {
+
     public int maxProfit(int[] prices){
         if(prices==null||prices.length==0){
             return 0;

…de/array/BestTimeToBuyAndSellStock2.java …ray/_122_BestTimeToBuyAndSellStock2.javasrc/main/java/leetcode/array/BestTimeToBuyAndSellStock2.java renamed to src/main/java/leetcode/array/_122_BestTimeToBuyAndSellStock2.java src/main/java/leetcode/array/BestTimeToBuyAndSellStock2.java renamed to src/main/java/leetcode/array/_122_BestTimeToBuyAndSellStock2.java

@@ -14,7 +14,8 @@ your returned answers (both index1 and index2) are not zero-based.
 */
 import java.util.HashMap;
 
-public class TwoNums {
+public class _1_TwoNums {
+
     public int[] twoSum(int[] numbers, int target) {
         int[] res=new int[2];
         if(numbers==null||numbers.length==0){

src/main/java/leetcode/array/Sum3.java …c/main/java/leetcode/array/_15_Sum3.javasrc/main/java/leetcode/array/Sum3.java renamed to src/main/java/leetcode/array/_15_Sum3.java src/main/java/leetcode/array/Sum3.java renamed to src/main/java/leetcode/array/_15_Sum3.java

@@ -8,6 +8,7 @@
 
  */
 public class MergeTwoSortedLists {
+    
     public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
         ListNode dummy=new ListNode(-1);
         ListNode curr=dummy;