一些简单的逻辑

1.用三目运算符找出成绩的等级：

<span style="white-space:pre">	</span>char grade=(mark>=90 ? 'A':(mark>=60?'B':'C'));  <span style="white-space:pre">	</span><span style="color:#ff0000;">//判断成绩的等级；</span>

2.用三目运算符找出3个中最大的数：

<span style="white-space:pre">	</span>int max=(a>b?(a>c?a:c):(b>c?b:c));<span style="white-space:pre">	</span><span style="color:#ff0000;">//找出最大的数；</span>

3.对输入的3个数进行排序输出：

import java.util.Scanner;

public class Temp {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		System.out.println("请输入3个数：");
		int y = in.nextInt();
		int x = in.nextInt();
		int z = in.nextInt();
		if (x > y) {
			int m = x;
			x = y;
			y = m;
		}
		if (x > z) {
			int c = x;
			x = z;
			z = c;
		}
		if (y > z) {
			int b = z;
			z =y ;
			y = b;
		}
		<span style="color:#ff0000;">//一定要先找到最大（小）的数，在比较另外2个数的大小；</span>
		System.out.println("三个数由小到大为:" + x + "<" + y + "<" + z);
	}
}

<pre name="code" class="java">   <span style="color:#ff0000;"> /*错误逻辑*/</span><span style="white-space:pre">	</span>if (x > y) {
			int m = x;
			x = y;
			y = m;
		}
		if (y > z) {
			int b = z;
			z =y ;
			y = b;
		}
		if (x > z) {
			int c = x;
			x = z;
			z = c;
		}

4.数组中，找到某个数组的值，求该值的下标，否则输出，数组中没有这个数据：

import java.util.Scanner;

public class 数组找数据 {
	public static void main(String[] args) {
		char[] letter = new char[26];
		letter[0] = 'A';
		for (int i = 0; i < letter.length; i++) {

			letter[i] = (char) (letter[0] + i);
			System.out.print(letter[i] + ";");
		}
		System.out.println("输入您想找下标的数据值：");
		Scanner in = new Scanner(System.in);
		String str = in.nextLine();
		char r = str.toCharArray()[0];
		int num = 0;
		for (int i = 0; i < letter.length; i++) {
			if (letter[i] == r) {
				System.out.println("下标为" + i);
			} else {
				num++;
			}
			if (num == letter.length) {  <span style="white-space:pre">	</span><span style="color:#ff0000;">//如果检查次数<span style="font-family: Arial, Helvetica, sans-serif;">num == letter.length，说明从头到尾 的检查，均没有输出对于的i；则输出没有该数据</span></span>

				System.out.println("没有您找的数据");
			}

		}
	}
}