refactor 724

fishercoder1534 · fishercoder1534 · commit ebbeddc498b7 · 2020-07-22T12:42:56.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_724.java b/src/main/java/com/fishercoder/solutions/_724.java
@@ -1,36 +1,11 @@
 package com.fishercoder.solutions;
 
-/**
- * 724. Find Pivot Index
- *
- * Given an array of integers nums, write a method that returns the "pivot" index of this array.
- * We define the pivot index as the index where the sum of the numbers to the left of the index is equal
- * to the sum of the numbers to the right of the index.
- * If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.
-
- Example 1:
- Input:
- nums = [1, 7, 3, 6, 5, 6]
- Output: 3
- Explanation:
- The sum of the numbers to the left of index 3 (nums[3] = 6) is equal to the sum of numbers to the right of index 3.
- Also, 3 is the first index where this occurs.
-
- Example 2:
- Input:
- nums = [1, 2, 3]
- Output: -1
- Explanation:
- There is no index that satisfies the conditions in the problem statement.
-
- Note:
- The length of nums will be in the range [0, 10000].
- Each element nums[i] will be an integer in the range [-1000, 1000].
- */
 public class _724 {
     public static class Solution1 {
-        /**Space: O(n)
-         * Time: O(n)*/
+        /**
+         * Space: O(n)
+         * Time: O(n)
+         */
         public int pivotIndex(int[] nums) {
             if (nums == null || nums.length == 0) {
                 return -1;
@@ -50,8 +25,10 @@ public int pivotIndex(int[] nums) {
     }
 
     public static class Solution2 {
-        /**Space: O(1)
-         * Time: O(n)*/
+        /**
+         * Space: O(1)
+         * Time: O(n)
+         */
         public int pivotIndex(int[] nums) {
             int total = 0;
             for (int num : nums) {
