尼科徹斯定理(數列,找規律)
阿新 • • 發佈:2019-01-21
思路二:import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); while (scanner.hasNext()) { int n = scanner.nextInt(); StringBuffer sb = new StringBuffer(); int mid = n * n; if (mid % 2 == 1) { int count = (n - 1) / 2; for (int i = count; i >= 0; i--) { sb.append(mid - i * 2); sb.append("+"); } for (int i = 1; i < count; i++) { sb.append(mid + i * 2); sb.append("+"); } sb.append(mid + count * 2); } else { int count = n / 2; for (int i = count - 1; i >= 0; i--) { sb.append(mid - i * 2 - 1); sb.append("+"); } for (int i = 0; i < count - 1; i++) { sb.append(mid + i * 2 + 1); sb.append("+"); } sb.append(mid + (count - 1) * 2 + 1); } System.out.println(String.valueOf(sb)); } } }