[Leetcode] 724. Find Pivot Index

Problems: https://leetcode.com/problems/find-pivot-index/

class Solution {
    public int pivotIndex(int[] nums) {
        if(nums.length == 0) {
            return -1;
        } else {
            int i = 0;
            while(i < nums.length){
                int sum_left = 0, sum_right = 0;
                for(int left = 0; left < i; left++) {
                    sum_left += nums[left];
                }   
                for(int right = nums.length-1; right > i; right--) {
                    sum_right += nums[right];
                } 
                if(sum_left == sum_right) {
                    return i;
                }else{
                    i++;
                }
            }
            return -1;
        }
    }
}

TC: O(n)
SC: O(1)