编程2222

1-1 二叉排序树查找 *** 作

BSTree SearchBST(BSTree T,ElemType e){
    if(!T||T->data==e)return T;
    else if(edata)return SearchBST(T->lchild,e);
    else
        return SearchBST(T->rchild,e);
}

2-1 平衡二叉树的根

#include 
#include
typedef struct node *AVLTree;
struct node{
    int Data;
    AVLTree Left;
    AVLTree Right;
};
int High(AVLTree T){
    if(!T)
        return 0;
    int left=High(T->Left)+1;
    int right=High(T->Right)+1;
    return left>right?left:right;
}
AVLTree LL(AVLTree T){
    AVLTree T1;
    T1=T->Right;
    T->Right=T1->Left;
    T1->Left=T;
    return T1;
}
AVLTree RR(AVLTree T){
    AVLTree T1;
    T1=T->Left;
    T->Left=T1->Right;
    T1->Right=T;
    return T1;
}
AVLTree LR(AVLTree T){
    AVLTree T1,T2;
    T1=T->Left;
    T2=T1->Right;
    T->Left=NULL;
    T2->Right=T;
    T1->Right=NULL;
    T2->Left=T1;
    return T2;
}
AVLTree RL(AVLTree T){
    AVLTree T1,T2;
    T1=T->Right;
    T2=T1->Left;
    T->Right=NULL;
    T2->Left=T;
    T1->Left=NULL;
    T2->Right=T1;
    return T2;
}
AVLTree Insert(AVLTree T,int x){
    if(!T){
        AVLTree T =(AVLTree)malloc(sizeof(struct node));
        T->Data=x;
        T->Left=T->Right=NULL;
        return T;
    }else if(x>T->Data){
        T->Right=Insert(T->Right,x);
        if((High(T->Right)-High(T->Left))>=2){
            if(x>T->Right->Data)
                T=LL(T);
            else
                T=RL(T);
        }
    }else if(xData){
        T->Left=Insert(T->Left,x);
        if((High(T->Left)-High(T->Right))==2){
            if(xLeft->Data)
                T=RR(T);
            else
                T=LR(T);
        }
    }
    return T;
}
int main() {
    int n,x;
    AVLTree T=NULL;
    scanf("%d",&n);
    for (int i = 0; i < n; i++) {
        scanf("%d",&x);
        T=Insert(T,x);
    }
    printf("%d\n",T->Data);
    return 0;
}

1-1 分糖果（循环线性表）

import java.util.Scanner;
 
public class Main {
 
    public static void main(String[] args) {
 
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int tangGuo = 0;
        int temp;
        
        int array[] = new int[n];
 
        for (int i = 0; i < n; i++) {
            array[i] = sc.nextInt();
        }
 
        while (true) {
                        int x=0; //x用于记录数组中相同元素的个数
            for (int i = 0; i < n; i++) {
 
                if (array[i] % 2 != 0) {
                    array[i]++;
                    tangGuo++;
                }
            }
            for (int i = 0; i < n; i++) {
                array[i] = array[i] / 2;
            }
 
            temp = array[0]; //将第一个元素的一半赋值给临时变量
            for (int i = 0; i < n - 1; i++) {
 
                array[i] = array[i] + array[i + 1];
 
            }
            array[n - 1] = array[n - 1] + temp;
            
            for (int i = 0; i < n - 1; i++) {
                if (array[i] == array[i + 1])
                    ++x;
            }
            if (x == n-1) {
                System.out.print(tangGuo);
                break;
            }
        }
    }
}

1-2 表达式转换

import java.util.*;
 
public class Main {
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        String str = input.nextLine();
        Stack stk = new Stack();
        Map map = new HashMap();
        map.put('+', 1);map.put('-', 1);map.put('*', 2);map.put('/', 2);
        map.put('(', 3);map.put(')', 3);
        int index = 0;
        boolean flag = true;
        while(index < str.length()){
            
            if((index < 1 || str.charAt(index - 1) == '(') && (str.charAt(index) == '+' || str.charAt(index) == '-')  || isdigit(str.charAt(index))){
                if(flag) flag = false;
                else System.out.printf(" ");
                if(str.charAt(index) != '+') System.out.printf("%c", str.charAt(index));
                while(index + 1 < str.length() && (str.charAt(index + 1) == '.' || isdigit(str.charAt(index + 1))))
                    System.out.printf("%c", str.charAt(++index));
                index++;
            }else{
                
                if(str.charAt(index) == '(') stk.push(str.charAt(index));
                else if(str.charAt(index) == ')'){
                    while(!stk.empty() && stk.peek() != '('){
                        System.out.printf(" %c", stk.peek());
                        stk.pop();
                    }
                    stk.pop();
                }else{
                    while(!stk.empty() && stk.peek() != '(' && map.get(stk.peek()) >= map.get(str.charAt(index))){
                        System.out.printf(" %c", stk.peek());
                        stk.pop();
                    }
                    stk.push(str.charAt(index));
                }
                index++;
            }
        }
        while(!stk.empty()){
            System.out.printf(" %c", stk.peek());
            stk.pop();
        }
    }
    static boolean isdigit(char s){
        if(s == '1' || s == '2' || s == '3' || s == '4' || s == '5' || s == '6' || s == '7'
                || s == '8' || s == '9' || s == '0') {
            return true;
        }
        return false;
    }
}

3-1 优美的括号序列

#include 
 
using namespace std;
char s[1000];
 
int main(){
    while(~scanf("%s",s)){
         int count=0;
         int judge=1;
         int i;
         for(i=0;i