<awangdev>523. Continuous Subarray Sum_3.java
public boolean checkSubarraySum(int[] nums, int k) {
        if (nums == null || nums.length == 0) {
            return false;
        }
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            int sum = nums[i];
            for (int j = i + 1; j < n; j++) {
                sum += nums[j];
                if (sum == k || (k != 0 && sum % k == 0)) {
                    return true;
                }
            }
        }

        return false;
    }
public boolean var_0 ( int [ ] var_1 , int var_2 ) {
  if ( var_1 == null || var_1 . length == 0 ) {
    return false ;
  }
  int var_6 = var_1 . length ;
  for ( int var_7 = 0 ;
  var_7 < var_6 ;
  var_7 ++ ) {
    int var_8 = var_1 [ var_7 ] ;
    for ( int var_10 = var_7 + 1 ;
    var_10 < var_6 ;
    var_10 ++ ) {
      var_8 += var_1 [ var_10 ] ;
      if ( var_8 == var_2 || ( var_2 != 0 && var_8 % var_2 == 0 ) ) {
        return true ;
      }
    }
  }
  return false ;
}
