<awangdev>Triangle Count_1.java
public int triangleNumber(int[] nums) {
        if (nums == null || nums.length == 0) {
            return 0;
        }
        int count = 0;
        Arrays.sort(nums);
        for (int i = 2; i < nums.length; i++) {
            int start = 0;
            int end = i - 1;
            while (start < end) {
                if (nums[start] + nums[end] > nums[i]) {
                    count += end - start; 
                    end--;
                } else {
                    start++;
                }
            }
        }
        return count;
    }
public int sample_funcname ( int [ ] var_0 ) {
  if ( var_0 == null || var_0 . length == 0 ) {
    return 0 ;
  }
  int var_4 = 0 ;
  Arrays . sort ( var_0 ) ;
  for ( int var_8 = 2 ;
  var_8 < var_0 . length ;
  var_8 ++ ) {
    int var_9 = 0 ;
    int var_11 = var_8 - 1 ;
    while ( var_9 < var_11 ) {
      if ( var_0 [ var_9 ] + var_0 [ var_11 ] > var_0 [ var_8 ] ) {
        var_4 += var_11 - var_9 ;
        var_11 -- ;
      }
      else {
        var_9 ++ ;
      }
    }
  }
  return var_4 ;
}
