static Hashtable<Integer, Character> hashtable= new Hashtable<>();
static int key=1;
public static void hashtablepush(Character num){
    hashtable.put(key, num);
    key++;
}

public static char hashtablepop(){
    if (key==1) {
        return '\0';
    }
    char temp = hashtable.get(key-1);
    hashtable.remove(key-1);
    key--;
    return temp;
}

public static ArrayList<Integer> seq(int a[]){
    ArrayList<Integer> arrayList = new ArrayList<>();
    if (a==null||a.length==0) {
        return arrayList;
    }

    int resultIndex = 0;//存放连续子序列第一个值的下标
    int resultnum = 1;//存储连续子序列的长度

    int tempIndex = 0;
    int tempnum = 1;
    for (int i = 1; i < a.length; i++) {
        if(a[i]-a[i-1]!=1){//判断是否连续
            if (tempnum>resultnum) {
                resultnum = tempnum;
                resultIndex = tempIndex;
            }
            tempIndex = i;
            tempnum = 1;
            continue;
        }
        tempnum++;
    }

    if (tempnum>resultnum) {
        resultnum = tempnum;
        resultIndex = tempIndex;
    }

    for (int i = 0; i < resultnum; i++) {
        arrayList.add(a[resultIndex+i]);
    }
    return arrayList;
}

public static int Kth(int[] array,int num){
    int bigK = 1;
    if (array==null||array.length==0) {
        try {
            throw new Exception("array is illeagel.");
        } catch (Exception e) {
        }
    }
    boolean flag = false;
    for (int i = 0; i < array.length; i++) {
        if (array[i]>num) {
            bigK++;
            flag = true;
        }
    }
    if (!flag) {
        try {
            throw new Exception("num is no.");
        } catch (Exception e) {
        }
    }
    return bigK;
}

原文链接：https://blog.csdn.net/scgaliguodong123_/article/details/48372779

本站声明:网站内容来源于网络,如有侵权,请联系我们,我们将及时处理。