while循环语句,按照既定规律输入数字,提示正确与否

 编写一个游戏程序,首先输出 “3,5,10,17,29”.提示输入下一个数,如果输入正确, 显示输入正确,打印出当前所有数字并提示请输入下一个数,如果输入错误,显示输入数字不对,请重新输入
import java.util.Scanner;

/**
 * 
 */

/**
 * @author HP-Developer
 *
 */
public class Text7 {

	/**
	 * 
	 */
	

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
    System.out.println("3, 5, 10 ,17, 29"+"\n"+"请输入下一个数");
    Scanner sc= new Scanner(System.in);
    int a1=17;
	int a2=29;
	String b="3, 5, 10 ,17, 29";
    while(true){
    	
    	int s= sc.nextInt();
    	if(s==a1+a2+2){
    		System.out.println("输入正确"+"\n"+b+" "+s+"\n"+"请输入下一个数");
    		a1=a2;
    		a2=s;
    		b=b+" "+s;
    		
    	}else{
    		System.out.println("输入有误,请重新输入"+"请输入下一个数:");
    		
    	}
    	
    }
	}

}
“\n”是换行
#include <iostream> #include <cstdlib> using namespace std; typedef int ElemType; typedef int Status; #define OK 1 #define ERROR 0 typedef struct LNode { // 构造结构体 ElemType data; // 数据域 struct LNode *next; // 指针域 } LNode, *LinkList; // 名称 // 创建链表(头插法) void CreateList_L(LinkList &L, ElemType a[], int n) { LinkList p; L = (LinkList)malloc(sizeof(LNode)); L->next = NULL; for (int i = 0; i < n; i++) { p = (LinkList)malloc(sizeof(LNode)); p->data = a[i]; p->next = L->next; L->next = p; } } // 遍历链表 void ListTraverse(LinkList L) { LinkList p = L->next; while (p != NULL) { cout << p->data << " "; p = p->next; } cout << endl; } // 求前驱 Status PriorElem(LinkList L, ElemType cur_e, ElemType &pre_e) { LinkList p = L->next; LinkList pre = L; while (p != NULL) { if (p->data == cur_e) { if (pre != L) { pre_e = pre->data; return OK; } else { return ERROR; } } pre = p; p = p->next; } return ERROR; } // 求后继 Status NextElem(LinkList L, ElemType cur_e, ElemType &next_e) { LinkList p = L->next; while (p != NULL && p->data != cur_e) { p = p->next; } if (p != NULL && p->next != NULL) { next_e = p->next->data; return OK; } return ERROR; } // 找元素 Status GetElem_L(LinkList L, int i, ElemType &e) { int j = 1; LinkList p = L->next; while (p != NULL && j < i) { p = p->next; j++; } if (p != NULL && j == i) { e = p->data; return OK; } return ERROR; } // 定位元素 int LocateElem_L(LinkList L, ElemType e) { int i = 1; LinkList p = L->next; while (p != NULL) { if (p->data == e) { return i; } p = p->next; i++; } return ERROR; } // 求表长 int ListLength(LinkList L) { int n = 0; LinkList p = L->next; while (p != NULL) { n++; p = p->next; } return n; } // 插入元素 Status ListInsert_L(LinkList &L, int i, ElemType e) { int j = 0; LinkList p = L, s; if (i <= 0) return ERROR; while (j < i - 1 && p != NULL) { j++; p = p->next; } if (p == NULL) return ERROR; s = (LinkList)malloc(sizeof(LNode)); s->data = e; s->next = p->next; p->next = s; return OK; } // 删除元素 Status ListDelete_L(LinkList &L, int i, ElemType &e) { int j = 0; LinkList p = L, q; if (i <= 0) return ERROR; while (j < i - 1 && p != NULL) { j++; p = p->next; } if (p == NULL || p->next == NULL) return ERROR; q = p->next; e = q->data; p->next = q->next; free(q); return OK; } // 倒置链表 Status ListReverse(LinkList &L) { if (L == NULL || L->next == NULL) { return OK; } LinkList pre = NULL; LinkList cur = L->next; LinkList next = NULL; while (cur != NULL) { next = cur->next; cur->next = pre; pre = cur; cur = next; } L->next = pre; return OK; } // 合两个有序链表 LinkList MergeLists(LinkList L1, LinkList L2) { LinkList dummy = (LinkList)malloc(sizeof(LNode)); if (!dummy) { cerr << "内存分配失败!" << endl; exit(EXIT_FAILURE); } dummy->next = NULL; LinkList tail = dummy; LinkList p1 = L1->next; LinkList p2 = L2->next; while (p1 != NULL && p2 != NULL) { if (p1->data <= p2->data) { tail->next = p1; p1 = p1->next; } else { tail->next = p2; p2 = p2->next; } tail = tail->next; } if (p1 != NULL) { tail->next = p1; } if (p2 != NULL) { tail->next = p2; } LinkList mergedList = dummy->next; free查找问题修改
最新发布
03-21
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值