一、题目链接
http://noi.openjudge.cn/ch0107/15/
二、解题思路(Java)
三、解题思路(C++)
四、Java程序
import java.util.Scanner;
import static java.lang.Character.isLowerCase;
import static java.lang.Character.isUpperCase;
public class Main {
public String format(String drugName) {
char[] ans = drugName.toCharArray();
int n = ans.length;
if (isLowerCase(ans[0])) {
ans[0] = (char) (ans[0] - 32);
}
for (int i = 1; i < n; i++) {
if (isUpperCase(ans[i])) {
ans[i] = (char) (ans[i] + 32);
}
}
return String.valueOf(ans);
}
public static void main(String[] args) {
Main test = new Main();
Scanner input = new Scanner(System.in);
int n = input.nextInt();
String[] drugName = new String[n];
for (int i = 0; i < n; i++) {
drugName[i] = input.next();
}
for (int i = 0; i < n; i++) {
System.out.println(test.format(drugName[i]));
}
}
}
五、C++程序
#include <iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int m;
string drugName;
for (int i = 1; i <= n; i++)
{
cin >> drugName;
m = drugName.length();
if (islower(drugName[0]))
{
drugName[0] = toupper(drugName[0]);
}
for (int j = 1; j < m; j++)
{
if (isupper(drugName[j]))
{
drugName[j] = tolower(drugName[j]);
}
}
cout << drugName << endl;
}
return 0;
}