Leetcode 238 Product of Array Except Self

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

Follow up:
Could you solve it with constant space complexity? (Note: The output array does not count as extra space for the purpose of space complexity analysis.)

public class Solution {
    public int[] productExceptSelf(int[] nums) {
        int len=nums.length;
        int pro=1;
        int[] rst=new int[len];
        int counter=0;
        int index=0;
        for(int i=0;i<len;i++ ){
            if(nums[i]==0){
                counter++;
                index=i;
            }else{
                pro*=nums[i];
            }
            if(counter==2)
                break;
        }
        if(counter==0){
            for(int i=0;i<len;i++){
                rst[i]=pro/nums[i];
            }
        }else if(counter==1){
            rst[index]=pro;
        }

        return rst;
    }
}