T1:查找数组中的最大元素
public class MaxElementInArray {
public static void main(String[] args) {
int[] arr = {1, 3, 7, 6, 5}; int max = arr[0];
for (int i = 1; i < arr.length; i++) {
if (arr[i] > max)
{ max = arr[i]; } }
System.out.println("Maximum element in array: " + max); } }
T2:斐波那契数列(前n项)
import java.util.Scanner;
public class FibonacciSeries {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of terms: ");
int n = scanner.nextInt();
int first = 0, second = 1, next;
System.out.print("First " + n + " terms of Fibonacci series are: ");
for (int i = 0; i < n; i++) {
if (i <= 1)
next = i;
else
{ next = first + second; first = second; second = next; }
System.out.print(next + " "); } } }