Added 2 solutions & modified 1 solution

varunu28 · varunu28 · commit c13ae654e34b · 2019-07-27T09:28:38.000-07:00
diff --git a/Easy/Armstrong Number.java b/Easy/Armstrong Number.java
@@ -0,0 +1,27 @@
+class Solution {
+    public boolean isArmstrong(int N) {
+        int n = getLength(N);
+        return getNthPowerSum(N, n) == N;
+    }
+
+    private int getNthPowerSum(int n, int p) {
+        int sum = 0;
+        while (n > 0) {
+            int temp = n % 10;
+            n /= 10;
+            sum += (int) Math.pow(temp, p);
+        }
+
+        return sum;
+    }
+
+    private int getLength(int n) {
+        int count = 0;
+        while (n > 0) {
+            n /= 10;
+            count++;
+        }
+
+        return count;
+    }
+}
diff --git a/Easy/Largest Unique Number.java b/Easy/Largest Unique Number.java
@@ -0,0 +1,17 @@
+class Solution {
+    public int largestUniqueNumber(int[] A) {
+        Map<Integer, Integer> map = new HashMap<>();
+        for (int num : A) {
+            map.put(num, map.getOrDefault(num, 0) + 1);
+        }
+
+        int maxVal = Integer.MIN_VALUE;
+        for (Integer key : map.keySet()) {
+            if (map.get(key) == 1) {
+                maxVal = Math.max(maxVal, key);
+            }
+        }
+
+        return maxVal == Integer.MIN_VALUE ? -1 : maxVal;
+    }
+}
diff --git a/Medium/Teemo Attacking.java b/Medium/Teemo Attacking.java
@@ -1,14 +1,16 @@
 class Solution {
     public int findPoisonedDuration(int[] timeSeries, int duration) {
+        if (duration == 0 || timeSeries.length == 0) {
+            return 0;
+        }
+
+        int totalTime = 0;
+        int beginTime = timeSeries[0];
+        for (int time : timeSeries) {
+            totalTime += (time < beginTime + duration ? time - beginTime : duration);
+            beginTime = time;
+        }
         
-        if (timeSeries.length == 0 || duration == 0) return 0;
-        
-            int begin = timeSeries[0], total = 0;
-            for (int t : timeSeries) {
-                total = total + (t < begin + duration ? t - begin : duration);
-                begin = t;
-            }   
-        
-        return total + duration;
+        return totalTime + duration;
     }
 }
