Sep 23, 2014 · Sep 23, 2014 · Sep 25, 2014 · Sep 25, 2014 · Sep 25, 2014 · Sep 26, 2014
diff --git a/array/MaxProduct.java b/array/MaxProduct.java
 public class MaxProduct {
    public static int maxProduct(int[] A) {
        int max = 0;

        int left = 0;
        int right = 0;


        int len = A.length;

        int product = 1;
            if (A[i] <= 0) {
                max = Math.max(max, product);
                product = 1;
                continue;
            }

            product *= A[i];
        }

        return0;
        returnmax;
    }

    /*
diff --git a/array/RemoveDuplicates.java b/array/RemoveDuplicates.java
 package Algorithms.array;

 public class RemoveDuplicates {
    public int removeDuplicates(int[] A) {
        if (A == null || A.length == 0) {
            return 0;
        }

        // A里至少有1个元素
        int len = 1;

        for (int i = 1; i < A.length; i++) {
            if (A[i] != A[i - 1]) {
                A[len++] = A[i];
            }
        }

        return len;
    }
 }
Original file line number	Diff line number	Diff line change
Expand Up		@@ -3,10 +3,7 @@
		public class MaxProduct {
		public static int maxProduct(int[] A) {
		int max = 0;

		int left = 0;
		int right = 0;


		int len = A.length;

		int product = 1;
Expand All		@@ -15,11 +12,13 @@ public static int maxProduct(int[] A) {
		if (A[i] <= 0) {
		max = Math.max(max, product);
		product = 1;
		continue;
		}

		product *= A[i];
		}

		return0;
		returnmax;
		}

		/*
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,20 @@
		package Algorithms.array;

		public class RemoveDuplicates {
		public int removeDuplicates(int[] A) {
		if (A == null \|\| A.length == 0) {
		return 0;
		}

		// A里至少有1个元素
		int len = 1;

		for (int i = 1; i < A.length; i++) {
		if (A[i] != A[i - 1]) {
		A[len++] = A[i];
		}
		}

		return len;
		}
		}