org.openurp.base.time.NumberSequence Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of openurp-base-api4j Show documentation

There is a newer version: 0.9.4

/*
 * OpenURP, Agile University Resource Planning Solution.
 *
 * Copyright © 2014, The OpenURP Software.
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful.
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see .
 */
package org.openurp.base.time;

import java.util.List;

import org.beangle.commons.collection.CollectUtils;

public class NumberSequence {

  public static enum Pattern {
    CONTINUE, EVEN, ODD
  }

  /**
   * 获得数组
   *
   * @param start 闭区间的开始
   * @param end 闭区间的结束
   * @param pattern 单、双、连续模式
   * @return
   */
  public static int[] build(int start, int end, NumberSequence.Pattern pattern) {
    Integer[] integers = buildInteger(start, end, pattern);
    int[] ints = new int[integers.length];
    for (int i = 0; i < integers.length; i++) {
      ints[i] = integers[i];
    }
    return ints;
  }

  public static Integer[] buildInteger(int start, int end, NumberSequence.Pattern pattern) {
    if (start > end) { return buildInteger(end, start, pattern); }
    List integers = CollectUtils.newArrayList();
    for (int i = start; i <= end; i++) {
      if (pattern == Pattern.CONTINUE) {
        integers.add(i);
      } else if (pattern == Pattern.EVEN) {
        if (i % 2 == 0) {
          integers.add(i);
        }
      } else {
        if (i % 2 != 0) {
          integers.add(i);
        }
      }
    }
    return integers.toArray(new Integer[0]);
  }

}