Improve solution for 908 (#48)

havanagrawal · fishercoder1534 · commit e3ee9a1f69e7 · 2019-04-24T07:36:37.000-07:00
diff --git a/README.md b/README.md
@@ -61,7 +61,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |925|[Long Pressed Name](https://leetcode.com/problems/long-pressed-name/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_925.java) | O(n) | O(1) | |Easy|
 |922|[Sort Array By Parity II](https://leetcode.com/problems/sort-array-by-parity-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_922.java) | O(n) | O(1) | |Easy|
 |917|[Reverse Only Letters](https://leetcode.com/problems/reverse-only-letters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_917.java) | O(n) | O(n) | |Easy|
-|908|[Smallest Range I](https://leetcode.com/problems/smallest-range-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_908.java) | O(nlogn) | O(1) | |Easy|
+|908|[Smallest Range I](https://leetcode.com/problems/smallest-range-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_908.java) | O(n) | O(1) | |Easy|
 |900|[RLE Iterator](https://leetcode.com/problems/rle-iterator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_900.java) | O(n) | O(1) | |Medium|
 |897|[Increasing Order Search Tree](https://leetcode.com/problems/increasing-order-search-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_897.java) | O(n) | O(n) | |Easy| DFS, recursion
 |896|[Monotonic Array](https://leetcode.com/problems/monotonic-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_896.java) | O(n) | O(1) | |Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_908.java b/src/main/java/com/fishercoder/solutions/_908.java
@@ -37,17 +37,31 @@
  * 0 <= K <= 10000
  */
 public class _908 {
-  public static class Solution1 {
-    public int smallestRangeI(int[] A, int K) {
-      Arrays.sort(A);
-      int smallestPlus = A[0] + K;
-      int biggestMinus = A[A.length - 1] - K;
-      int diff = biggestMinus - smallestPlus;
-      if (diff > 0) {
-        return diff;
-      } else {
-        return 0;
+    public static class Solution1 {
+        public int smallestRangeI(int[] A, int K) {
+          Arrays.sort(A);
+          int smallestPlus = A[0] + K;
+          int biggestMinus = A[A.length - 1] - K;
+          int diff = biggestMinus - smallestPlus;
+          if (diff > 0) {
+              return diff;
+          } else {
+              return 0;
+          }
+      }
+  }
+
+  public static class Solution2 {
+      public int smallestRangeI(int[] A, int K) {
+          int min = A[0];
+          int max = A[0];
+
+          for (int k : A) {
+            min = Math.min(min, k);
+            max = Math.max(max, k);
+          }
+
+          return Math.max(max - min - 2*K, 0);
       }
-    }
   }
 }
diff --git a/src/test/java/com/fishercoder/_908Test.java b/src/test/java/com/fishercoder/_908Test.java
@@ -8,28 +8,33 @@
 
 public class _908Test {
   private static _908.Solution1 solution1;
+  private static _908.Solution2 solution2;
   private static int[] A;
 
   @BeforeClass
   public static void setup() {
     solution1 = new _908.Solution1();
+    solution2 = new _908.Solution2();
   }
 
   @Test
   public void test1() {
     A = new int[] {1};
     assertEquals(0, solution1.smallestRangeI(A, 0));
+    assertEquals(0, solution2.smallestRangeI(A, 0));
   }
 
   @Test
   public void test2() {
     A = new int[] {0, 10};
     assertEquals(6, solution1.smallestRangeI(A, 2));
+    assertEquals(6, solution2.smallestRangeI(A, 2));
   }
 
   @Test
   public void test3() {
     A = new int[] {1, 3, 6};
     assertEquals(0, solution1.smallestRangeI(A, 3));
+    assertEquals(0, solution2.smallestRangeI(A, 3));
   }
 }

Original file line number	Diff line number	Diff line change
`@@ -8,28 +8,33 @@`
`8`	`8`
`9`	`9`	`public class _908Test {`
`10`	`10`	`private static _908.Solution1 solution1;`
	`11`	`+ private static _908.Solution2 solution2;`
`11`	`12`	`private static int[] A;`
`12`	`13`
`13`	`14`	`@BeforeClass`
`14`	`15`	`public static void setup() {`
`15`	`16`	`solution1 = new _908.Solution1();`
	`17`	`+ solution2 = new _908.Solution2();`
`16`	`18`	`}`
`17`	`19`
`18`	`20`	`@Test`
`19`	`21`	`public void test1() {`
`20`	`22`	`A = new int[] {1};`
`21`	`23`	`assertEquals(0, solution1.smallestRangeI(A, 0));`
	`24`	`+ assertEquals(0, solution2.smallestRangeI(A, 0));`
`22`	`25`	`}`
`23`	`26`
`24`	`27`	`@Test`
`25`	`28`	`public void test2() {`
`26`	`29`	`A = new int[] {0, 10};`
`27`	`30`	`assertEquals(6, solution1.smallestRangeI(A, 2));`
	`31`	`+ assertEquals(6, solution2.smallestRangeI(A, 2));`
`28`	`32`	`}`
`29`	`33`
`30`	`34`	`@Test`
`31`	`35`	`public void test3() {`
`32`	`36`	`A = new int[] {1, 3, 6};`
`33`	`37`	`assertEquals(0, solution1.smallestRangeI(A, 3));`
	`38`	`+ assertEquals(0, solution2.smallestRangeI(A, 3));`
`34`	`39`	`}`
`35`	`40`	`}`