我目前在我的主要方法中調(diào)用我的每個(gè)方法（int）時(shí)遇到問(wèn)題，我的每個(gè)調(diào)用都收到錯(cuò)誤“找不到變量”。如何修復(fù)我的代碼，以便我可以調(diào)用每個(gè)方法并為每個(gè)單獨(dú)的方法提供一個(gè)輸出？這是我的代碼：import java.util.*;public class Method{ public static void main(String [] args) { System.out.println(evenOdd(x)); System.out.println(boxMake(n)); System.out.println(checkPrime(n)); } public static boolean evenOdd(int x) { Scanner sc = new Scanner(System.in); System.out.println("Enter your number to check even or odd: "); x = sc.nextInt(); boolean odd = false;if(x % 2 ==0){odd = true; System.out.println(odd + " is true."); }return odd;}public static void boxMake(int n) {Scanner sc = new Scanner(System.in); System.out.println("Enter your number to make a box: ");n = sc.nextInt();for(int i=0; i<n; i++){ for(int x=0; x<n; x++){ System.out.print("*"); } System.out.println(""); }} public static int checkPrime(int n){ int i; int m=0; int flag=0; Scanner sc = new Scanner(System.in); System.out.println("Enter a number to check if prime: "); n = sc.nextInt(); m=n/2; if(n==0||n==1){ System.out.println(n + " is not a prime number"); }else{ for(i=2; i<=m; i++){ if(n % i == 0){ System.out.println(n + " is not a prime number"); flag = 1; break; } } if(flag == 0){ System.out.println(n + " is a prime number"); } } return n; }}
3 回答
明月笑刀無(wú)情
TA貢獻(xiàn)1828條經(jīng)驗(yàn) 獲得超4個(gè)贊
請(qǐng)將您的代碼修改為：
public class Example {
public static void main(String[] args) {
int x = 0, n = 0, p = 0;
Scanner sc = new Scanner(System.in);
System.out.println("Enter your number to check even or odd: ");
x = sc.nextInt();
evenOdd(x);
System.out.println("Enter your number to make a box: ");
n = sc.nextInt();
boxMake(n);
System.out.println("Enter a number to check if prime: ");
p = sc.nextInt();
checkPrime(p);
sc.close();
}
public static void evenOdd(int x) {
if (x % 2 == 0) {
System.out.println(x + " is even.");
return;
}
System.out.println(x + " is odd.");
}
public static void boxMake(int n) {
for (int i = 0; i < n; i++) {
for (int x = 0; x < n; x++) {
System.out.print("*");
}
System.out.println("");
}
}
public static void checkPrime(int n) {
int i;
int m = 0;
int flag = 0;
m = n / 2;
if (n == 0 || n == 1) {
System.out.println(n + " is not a prime number");
} else {
for (i = 2; i <= m; i++) {
if (n % i == 0) {
System.out.println(n + " is not a prime number");
flag = 1;
break;
}
}
if (flag == 0) {
System.out.println(n + " is a prime number");
}
}
}
}
慕無(wú)忌1623718
TA貢獻(xiàn)1744條經(jīng)驗(yàn) 獲得超4個(gè)贊
n并且x是您方法中的局部變量。請(qǐng)記住，例如nfrom與fromevenOdd()相同，除了名稱之外什么都沒(méi)有。如果你想在你的類中使用并且將它們定義為類成員。nboxMake()nx
import java.util.*;
public class Method{
private int n;
private int x;
寶慕林4294392
TA貢獻(xiàn)2021條經(jīng)驗(yàn) 獲得超8個(gè)贊
使 main 方法看起來(lái)像這樣，并從您的方法中刪除 Scanners，如下所示：
public static void main(String [] args) {
Scanner sc = new Scanner(System.in);
System.out.println("Enter your number to check even or odd: ");
x = sc.nextInt();
System.out.println("Enter your number to make a box: ");
n = sc.nextInt();
System.out.println(evenOdd(x));
System.out.println(boxMake(n));
System.out.println(checkPrime(n));
}
public static boolean evenOdd(int x) {
boolean odd = false;
if(x % 2 ==0){
odd = true;
System.out.println(odd + " is true.");
}
return odd;
}
public static void boxMake(int n) {
for(int i=0; i<n; i++){
for(int x=0; x<n; x++){
System.out.print("*");
}
System.out.println("");
}
}
public static int checkPrime(int n){
int i;
int m=0;
int flag=0;
m=n/2;
if(n==0||n==1){
System.out.println(n + " is not a prime number");
}else{
for(i=2; i<=m; i++){
if(n % i == 0){
System.out.println(n + " is not a prime number");
flag = 1;
break;
}
}
if(flag == 0){
System.out.println(n + " is a prime number");
}
}
return n;
}
}
添加回答
舉報(bào)
0/150
提交
取消