comefrom: <awangdev>523. Continuous Subarray Sum_3.java
code: 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;
      }
masked: public boolean var_0 ( int [ ] var_1 , int var_2 ) {
    if ( var_1 == null || var_1 . length == 0 ) {
      return false ;
    }
    int var_3 = var_1 . length ;
    for ( int var_4 = 0 ;
    var_4 < var_3 ;
    var_4 ++ ) {
      int var_5 = var_1 [ var_4 ] ;
      for ( int var_6 = var_4 + 1 ;
      var_6 < var_3 ;
      var_6 ++ ) {
        var_5 += var_1 [ var_6 ] ;
        if ( var_5 == var_2 || ( var_2 != 0 && var_5 % var_2 == 0 ) ) {
          return true ;
        }
      }
    }
    return false ;
  }
  