g3001_3100.s3028_ant_on_the_boundary.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

The newest version!

package g3001_3100.s3028_ant_on_the_boundary;

// #Easy #Array #Simulation #Prefix_Sum #2024_03_01_Time_0_ms_(100.00%)_Space_42.1_MB_(53.10%)

public class Solution {
    public int returnToBoundaryCount(int[] nums) {
        int ans = 0;
        int num = 0;
        for (int n : nums) {
            num += n;
            if (num == 0) {
                ans++;
            }
        }
        return ans;
    }
}