[LeetCode]Product of Array Except Self

public class Solution {
    public int[] productExceptSelf(int[] nums) {
        int length = nums.length;
        int[] result = new int[length];
        int tmp = 1;
        for (int i = 0; i < length - 1; i++) {
            tmp *= nums[i];
            result[i] = tmp;
        }
        tmp = 1;
        for (int i = length - 1; i > 0; i--) {
            result[i] = tmp * result[i - 1];
            tmp *= nums[i];
        }
        result[0] = tmp;
        return result;
    }
}

public class Solution {
    public int[] productExceptSelf(int[] nums) {
        int length = nums.length;
        int[] result = new int[length];
        int zero = 0;
        int index = 0;
        int tmp = 1;
        for (int i = 0; i < length; i++) {
            int num = nums[i];
            if (num == 0) {
                if (zero > 0) {
                    return result;
                } 
                zero ++;
                index = i;
            } else {
                tmp *= num;
            }
        }
        if (zero != 0) {
            result[index] = tmp;
            return result;
        }
        for (int i = 0; i < length; i++) {
            result[i] = tmp / nums[i];
        }
        return result;
    }
}