猜字符串

Write a program that guesses a string of at least 10 randomly generated letters. Each letter
has a value associated with it corresponding to its position in the alphabet. So A = 1, B = 2, …
Y = 25, Z = 26.
The program should then guess letters until every letter has been guessed. The correctly
guessed letters along with the total value of the remaining string should be displayed after every
round of guessing. Keep a record of the letters that have been guessed and use the current
value to narrow the field of possible letters. When the program is finished, the total number of
rounds should be printed out. The idea is to minimize the number of guessing rounds.
For example assuming the random string generated was: THUPHEHEY
Before the first guess, the program would display:
_ _ _ _ _ _ _ _ _ _ 116
If the program guesses H the display should read:

_ H _ _ H _ H_ _ 92


package Haoshuo;


public class GuessString {


/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
        String rs = "DTUUUMN";
        int value = 114;
        char[] a = {'0', 'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 
              'M', 'N', 'O', 'P', 'Q', 'R'
             , 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
        
        int[] result = new int[rs.length()];
        
        guess(rs, rs.length(), value, a, result);
        
}
    
public static void guess(String randString, int lenString, int v, char[] alph, int[] r){
int t = 0;
char[] s = randString.toCharArray();
boolean finished = true;
boolean find = false;


for(int i = alph.length - 1; i > 0; i--){

while(t < lenString){

if(Character.compare(s[t], alph[i]) == 0){
r[t] = i;
v = v - i;
find = true;
}
if(r[t] == 0){
finished = false;
}
t++;
}

if(finished){
break;
}
                
                if(v <= 26 && find && v < i){
                i = v + 1;
                find = false;
                }
                
                t = 0;
                
        for(int j = 0; j < r.length; j++){
       
        if(r[j] == 0){
        System.out.print("_");
        }
        else{
        System.out.print(alph[r[j]]);
        }
        }
        System.out.print(" " + v + "\n");
       
}
        
}
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值