剑指Offer面试题57 - II. 和为s的连续正数序列

if n%2 == 1{
    a1 := target/n - n/2
}else{
  a1 := target/n - n/2 + 1
}

func findContinuousSequence(target int) [][]int {
  var res [][]int
  for n := 2; n < target; n++ {
    a1 := target/n - n/2 - (n%2 - 1)
    if a1 < 1 {
      break
    }
    if target == (a1+(a1+n-1))*n/2  {
      var res_col []int
      for i := a1; i < a1+n; i++ {
        res_col = append(res_col, i)
      }
      res = append(res, res_col)
    }
  }
  var revort_res [][]int
  for i:=len(res)-1;i>=0;i--{
    revort_res = append(revort_res,res[i])
  }
  return revort_res
}

 var findContinuousSequence = function(target) {
          let arr = [];
          for (let i = 1; i < target - 1; i++) {
            let list = [i, i + 1];
            while (add(list) <= target) {
              if (add(list) === target) {
                arr.push(list);
              } else {
                list.push(list[list.length - 1] + 1);
              }
            }
          }
          console.log(arr);
          return arr;
        };
        function add(arr) {
          const reducer = (total, current) => total + current;
          return arr.reduce(reducer);
        }