HuaWeiJava 上机

/*
     * 第二题，输入字符串长度，字符串，计数m。从前往后计数，当数到m个元素时，m个元素出列，同时将该元素赋值给m，
     * 然后从下一个数计数循环，直到所有数字都出列，给定的数全部为大于0的数字。输出出队队列。
     * 例如:  输入：len=4    str="3,1,2,4"   m=7   
     * 输出：2,3,1,4 
     */
     public static String getOutString(int len, String str, int m) {
         String[] ss = str.split(",");
         ArrayList<Integer> arrayInt = new ArrayList<Integer>();
         Stack<Integer> stackInt = new Stack<Integer>();
         String s = "";
         
         for(int i = 0; i < ss.length; i++){
             arrayInt.add(Integer.parseInt(ss[i]));
         }
         
         while(arrayInt.size() != 0){
            
             
             int n = m % arrayInt.size();//第n个数，在arrayInt 中是第 n - 1 个数
             if(n == 0) {
                 n = arrayInt.size();
             }
             m = arrayInt.get(n - 1);
             //arrayInt.remove(n - 1);
             //arrayInt 中 第n个数开始
             for(int i = n - 2; i >= 0; i--){
                 stackInt.push(arrayInt.get(i));
             }
             for(int i = arrayInt.size() - 1; i > n -1; i--){
                 stackInt.push(arrayInt.get(i));
             }
             System.out.println(arrayInt.remove(n - 1) +"");
             for(int i = 0; i < arrayInt.size(); i++){
                 arrayInt.set(i, stackInt.pop());
             }
         }
         return s;
     }

 

import java.util.ArrayList;
import java.util.List;


public class HuaWeiTest {

    public static void main(String[] args) {
        int len=4;
        String str="3,1,2,4";   
        int m=7;  
        HuaWeiTest hwt = new HuaWeiTest();
        System.out.println(hwt.getOutString(len, str, m));
    }
    public String getOutString(int len, String str, int m) {
        String ret ="";
        String[] arr = str.split(",");
        List<String> ls = new ArrayList<String>();
        for(int i=0;i<len;i++) {
            ls.add(arr[i]);
        }
        for(int i=0;i<len;i++) {
            int temp = (m-1)%ls.size();
            ret += ls.get(temp);
            m = Integer.parseInt(ls.get(temp))+temp;
            ls.remove(temp);
        }
        return ret;
    }
}

 

package com.huawei.test;

import java.util.ArrayList;
import java.util.List;
import java.util.Stack;
/**
 *  第三题，输入一个表达式，没有括号，数字小于0-9之间，输出计算结果，所有的中间结果化为整形。
 *    例如:  输入：3+8×2/9-2  
 *  输出：2  
 *
 * @author Administrator
 *
 */

public class HuaWeiTest {

    public static void main(String[] args) {
        
        System.out.println(getMyRet("3+8/2*2"));
    }

    public static int getMyRet(String str) {
        String expression = str.trim();
        Stack<Integer> operandStack = new Stack<Integer>();
        Stack<Character> operatorStack = new Stack<Character>();
        
        for(int i = 0; i < expression.length(); i++){
            char ch = expression.charAt(i);
            if(ch == '+' || ch == '-' ){//
                while(!operatorStack.isEmpty() && (operatorStack.peek() == '+' 
                        || operatorStack.peek() == '-' 
                        || operatorStack.peek() == '*' 
                        || operatorStack.peek() == '/')){
                    processAnOperator(operandStack, operatorStack);
                }
                operatorStack.push(ch);
            }
            else if (ch == '*' || ch == '/'){
                while(!operatorStack.isEmpty() && ( 
                    operatorStack.peek() == '*' || operatorStack.peek() == '/')){
                    processAnOperator(operandStack, operatorStack);
                }
                operatorStack.push(ch);
            }
            else{
                operandStack.push(ch - '0');
            }    
        }
        while(!operatorStack.isEmpty()){
            processAnOperator(operandStack, operatorStack);
        }
        return operandStack.pop();                                              
    }
    public static void processAnOperator(Stack<Integer> operandStack, Stack<Character> operatorStack){
        char op = operatorStack.pop();
        int op1 = operandStack.pop();
        int op2 = operandStack.pop();
        switch (op) {
        case '+':
            operandStack.push(op1 + op2);
            break;
        case '-':
            operandStack.push(op2 - op1);
            break;
        case '*':
            operandStack.push(op1 * op2);
            break;
        case '/':
            operandStack.push(op2 / op1);
            break;
        default:
            break;
        }
    }
}