import java.util.Scanner;import java.lang.Math;publicclassMain{
publicstaticvoidmain(String[] args){
Scanner in =newScanner(System.in);while(in.hasNextLine()){
String s = in.nextLine();//读入数字int count =0;//记录转换后的数字for(int i=0; i < s.length()-2; i++){
//由于前面两位是'0x',故从第三位开始char tc = s.charAt(i+2);int t =0;//记录字母转换成的数值//将字母转换为数值if(tc>='0'&& tc<='9')
t = tc -'0';//字母'A'/'a'~'F''f'对应数字10~15elseif(tc>='A'&& tc<='F')
t = tc -'A'+10;elseif(tc>='a'&& tc<='f')
t = tc -'a'+10;//计算加和
count += t * Math.pow(16, s.length()-i-3);}
System.out.println(count);}}}
import java.util.Scanner;publicclassMain{
publicstaticvoidmain(String[] args){
Scanner in =newScanner(System.in);while(in.hasNext()){
String str = in.nextLine();
String s1 = str.substring(2);int a = Integer.valueOf(s1,16);
System.out.println(a);}}}
(3)快速排序
import java.util.*;publicclassTest{
publicstaticvoidmain(String[] args){
Scanner sc =newScanner(System.in);//获取个数int num = sc.nextInt();//创建TreeSet进行去重排序
TreeSet set =newTreeSet();//输入for(int i =0; i < num ;i++){
set.add(sc.nextInt());}//输出
Iterator iterator = set.iterator();while(iterator.hasNext()){
System.out.println(iterator.next());}}}
classSolution{
public:intjumpFloor(int number){
if(number <=0){
return0;}if(number ==1){
return1;}if(number ==2){
return2;}int first =1, second =2, third =0;for(int i =3; i <= number; i++){
third = first + second;
first = second;
second = third;}return third;}};
字符串操作
import java.util.*;import java.io.*;publicclassMain{
publicstaticvoidmain(String[] args)throws IOException {
BufferedReader bf =newBufferedReader(newInputStreamReader(System.in));
String[] in = bf.readLine().split(";");int x =0;int y =0;for(String s : in){
// 不满足题目给定坐标规则if(!s.matches("[WASD][0-9]{1,2}")){
continue;}int val = Integer.valueOf(s.substring(1));switch(s.charAt(0)){
case'W':
y += val;break;case'S':
y -= val;break;case'A':
x -= val;break;case'D':
x += val;break;}}
System.out.println(x+","+y);}}