package huawei;
import java.util.*;
public class Main {public static void main(String args[]) {Scanner cin = new Scanner(System.in);String string = cin.nextLine();System.out.println(FindUpper(string));}public static String FindUpper(String str) {String out = "";char[] charArray = str.toCharArray();for (int i = 0; i < charArray.length; i++) {if (charArray[i] <= 90 && charArray[i] >= 65) {out = out + charArray[i];}}return out;}
}

题目2：数组排序
描述: 用户输入有符号整型数组（十进制），去掉重复值后，按照升序输出整型数组（十进制）。
    输入: 整数N，表示数组的个数；N个整数，整数之间以空格隔开
    输出: 去掉重复后，按照升序输出数组
    样例输入:4 6 3 3 9 
    样例输出:3 4 6 9
    参考答案：

package paixu;
import java.util.*;
public class Main {public static void main(String[] args) {// TODO Auto-generated method stubScanner cin = new Scanner(System.in);ArrayList<Integer> al = new ArrayList<Integer>();String[] srr = cin.nextLine().split(" ");for (int i = 1; i <= Integer.parseInt(srr[0]); i++) {al.add(Integer.parseInt(srr[i]));}Main a = new Main();a.bubble(al);}public void bubble(ArrayList<Integer> all) {int len = all.size();boolean flag = false;// 使用冒泡法，实现升序排序for (int i = 1; i <= len; i++) {for (int j = 1; j <= len - i; j++) {Integer a1 = all.get(j - 1);Integer a2 = all.get(j);if (a1 > a2) {// 若前面的大于后面的，这交换次序，实现升序排序；all.set(j - 1, a2);all.set(j, a1);flag = true;// 如果有数据交换，则flag为true}}if (flag == false)break;}StringBuilder sb = new StringBuilder();sb.append(all.get(0) + " ");for (int i = 1; i < len; i++) {if (all.get(i) == all.get(i - 1))continue;sb.append(all.get(i) + " ");}System.out.println(sb.toString());}
}

#include<iostream>
#include<string>
using namespace std;
void quickSort(vector<int>&a,int l,int r)
{   if(l<r){int i=l,j=r-1;int tmp=a[i];while(i<j){while(i<j&&a[j]>tmp)j--;if (i<j){a[i++]=a[j];}while(i<j&&a[i]<tmp)i++;if (i<j){a[j--]=a[i];}}a[i]=tmp;quickSort(a,l,i);quickSort(a,i+1,r);}
}
int main()
{   string str,tmpStr;getline(cin,str);vector<int>array;int len=str.size();int j=0;int i;for( i=0;i<len;){while(i<len&&str[i]!=' ')i++;while(j<i){tmpStr+=str[j];j++;}array.push_back(atoi(tmpStr.c_str()));i++;j=i;tmpStr.clear();}/* 快速排序  ; */int l=0;int r=array.size();quickSort(array,l,r);/*输出;*/for (int k=0;k<r;){int index=k+1;while(index<r&&array[index]==array[k]){index++;   }cout<<array[k]<<" ";k=index;}cout<<endl;system("pause");
}

package erchashu;
import java.util.*;
public class Main {public static void main(String[] args) {// TODO Auto-generated method stubScanner sc = new Scanner(System.in);String str1 = sc.nextLine();Main aa = new Main();int high = str1.charAt(str1.length()-1)-'1'+1;//�߶�for(int i=1;i<str1.length()/2;i++){int c2 = Integer.parseInt(str1.charAt(i*2-1)+"");if(high<c2){high=c2;}}int max = 1;//��������for(int i = 1;i<=high;i++){max *= 2;}char[] crr = new char[max];for(int i = 1;i<=str1.length()/2;i++){int c2 = str1.charAt(i*2-1)-'1'+1;char c1 = str1.charAt(i*2-2);int num =1;for(int j=1;j<c2;j++){num*=2;}while(crr[num]!='\u0000'){num++;}crr[num] = c1;}String str2 = sc.nextLine();StringBuilder sb = new StringBuilder();for (char c : str2.toCharArray()){int index = 0;for(index =0;index<crr.length;index++){if(crr[index]==c){ break;}}sb.append(aa.shendu(crr,index));sb.append(' ');}String ss = sb.toString();System.out.println(ss.substring(0,ss.length()));}public int shendu(char[] crr, int i) {if(i>=crr.length){return 0;}if(crr[i]=='\u0000'){return 0;}else{int a = shendu(crr,2*i);int b = shendu(crr,2*i+1);return (a>=b)? a+1:b+1;}}
}

#include<iostream>
#include<string>
using namespace std;
int main()
{   string str,user_str;getline(cin,str);getline(cin,user_str);int len=str.size();int user_len=user_str.size();int maxDepth=atoi(&str[len-1]);//最大的深度;for (int i=0;i<user_len;i++){char user_tmp=user_str[i];for(int j=0;j<len;j++){if (user_tmp==str[j]){int position=atoi(&str[++j]);cout<<maxDepth-position+1<<" ";break;}if (j==len-1){cout<<0<<" ";break;}}}cout<<endl;system("pause");
}