例4-2 UVa489 Hangman Judge
来源:互联网 发布:java反序列化漏洞原理 编辑:程序博客网 时间:2024/05/16 14:28
要点:
1.利用一个left变量判断还剩几个字母,用chance判断还能猜几次,原来chance放在开头导致一直WA
#include<stdio.h>#include<string.h>#define maxn 100char s[maxn], s2[maxn];int left, chance,t;int win, lose;void guess(char ch){ int bad = 1; for (int i = 0; i < strlen(s); i++) { if (ch == s[i])//若猜中一个字母在字符串中所有该字母都会显露出来 { left--; s[i] = ' ';//未防止已经猜出的字母干扰,将已猜出的赋值为空格 bad = 0; } } if (bad) chance--; if (chance == 0) lose = 1; if (left == 0) win = 1;}int main(){ while (scanf("%d", &t),t != -1) { chance = 7;//值都应该放在循环中 scanf("%s%s", s, s2); win = lose = 0; left = strlen(s); printf("Round %d\n", t); for (int i = 0; i < strlen(s2); i++) { guess(s2[i]); if (win || lose) break; } if (win) printf("You win.\n"); else if (lose) printf("You lose.\n"); else printf("You chickened out.\n"); } return 0;}
学习心得:
1.要多次判断比较的值要放在循环中
0 0
- 例4-2 UVa489 Hangman Judge
- UVa489 - Hangman Judge-难度2
- uva489 Hangman Judge
- uva489-Hangman Judge
- UVa489 Hangman Judge
- Uva489 - Hangman Judge
- UVA489 Hangman Judge
- uva489 Hangman Judge (模拟)
- UVA489 - Hangman Judge
- UVA489-Hangman Judge
- uva489 - Hangman Judge
- UVa489 - Hangman Judge
- UVa489 Hangman Judge
- UVA489 Hangman Judge
- UVA489 - Hangman Judge
- UVa489 - Hangman Judge
- Hangman Judge uva489
- UVa489-Hangman Judge
- HDU 5124 lines
- LEETCODE--Balanced Binary Tree
- Git入门及上传项目到github中
- 关于ListView下拉崩溃的问题
- Neo4J几种数据导入方式的效率对比
- 例4-2 UVa489 Hangman Judge
- 多栈共享
- 了解 Linux內核架構 (2)
- java String / StringBuilder / StringBuffer 的使用
- JNI中如何在本地代码C++中操作java中的基本类型的数组以及对象数组
- Android 适配器委托模式
- day11
- 链栈 多链栈
- UFT中表的用法