学校的作业！求助！要求在附件里。能做的加微信哦Michael-Xiongda
////main.c
//qxiong1_project3
//
//Created by Qicheng Xiong on 2018/4/27.
//Copyright © 2018 Qicheng Xiong. All rights reserved.
//
/*
* Stack Project
*/
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <time.h>
#define EXTRA 0
/*########################### IMPLEMENT YOUR CODE HERE #########################*/
//Implement all your code here
/*##############################################################################*/
/*
DO NOT ALTER ANY CODE BELOW HERE
You may comment out certain tests for debugging purposes, but your final
submission should be unchanged from what is below.
*/
unsigned int memory_used = 0;
void main (){
printf("Heap Memory in use: %lu\n", memory_used);
/******************** Test #1 **************************/
printf("\n =========== Test # 1: Stack creation =========== \n");
struct stack * s = newStack(10);
assert(s->stk != 0);
assert(s->top == -1);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 1 passed\n");
/******************** Test #2 **************************/
printf("\n =========== Test # 2: push 1 value onto the stack =========== \n");
assert(push(s, 5) != -1);
display(s);
assert(s->stk == 5);
assert(s->top == 0);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 2 passed\n");
/******************** Test #3 **************************/
printf("\n =========== Test # 3: push 2nd value onto the stack =========== \n");
assert(push(s, 7) != -1);
display(s);
assert(s->stk == 5);
assert(s->stk == 7);
assert(s->top == 1);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 3 passed\n");
/******************** Test #4 **************************/
printf("\n =========== Test # 4: fill the stack =========== \n");
for(int i = 2; i < 10; i++){
assert(push(s, i+10) != -1);
display(s);
assert(s->stk == i+10);
assert(s->top == i);
assert(s->max_size == 10);
}
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 4 passed\n");
/******************** Test #5 **************************/
printf("\n =========== Test # 5: insert into full stack =========== \n");
assert(push(s, 10) == -1);
assert(s->top == 9);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 5 passed\n");
/******************** Test #6 **************************/
printf("\n =========== Test # 6: pop 1 value off the stack =========== \n");
assert(pop(s) == 19);
display(s);
assert(s->top == 8);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 6 passed\n");
/******************** Test #7 **************************/
printf("\n =========== Test # 7: pop 2nd value off the stack =========== \n");
assert(pop(s) == 18);
display(s);
assert(s->stk == 17);
assert(s->top == 7);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 7 passed\n");
/******************** Test #7 **************************/
printf("\n =========== Test # 8: push value onto the stack =========== \n");
assert(push(s, 20) != -1);
assert(push(s, 21) != -1);
display(s);
assert(s->stk == 21);
assert(s->top == 9);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 8 passed\n");
/******************** Test #9 **************************/
printf("\n =========== Test # 9: remove remaining elements from the stack =========== \n");
int array[] = {5, 7, 12, 13, 14, 15, 16, 17, 20, 21};
for(int i = sizeof(array)/sizeof(int) - 1; i >= 0; i--){
assert(pop(s) == array);
display(s);
assert(s->top == i-1);
assert(s->max_size == 10);
}
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test #9 passed\n");
/******************** Test #10 **************************/
printf("\n =========== Test # 10: pop from an empty stack =========== \n");
assert(pop(s) == -1);
assert(s->top == -1);
assert(s->max_size == 10);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test # 10 passed\n");
/******************** Test #11 **************************/
printf("\n =========== Test # 11: random elements into a random sized stack =========== \n");
srand(time(NULL));
int stack_size = (rand() % 500) + 5;
struct stack * rand_stack = newStack(stack_size);
int stest = -1;
int direction = 2;
for(int i = 0; i < stack_size * 10; i++){
if(rand() % 10 <= direction){
(pop(rand_stack) == -1) ? direction = 2 : stest--;
assert(rand_stack->top == stest);
}else{
(push(rand_stack, rand() % 100) == -1) ? direction = 8 : stest++;
assert(rand_stack->top == stest);
}
assert(rand_stack->max_size == stack_size);
}
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test #11 passed\n");
/******************** EXTRA CREDIT **************************/
#if EXTRA
printf("\n=========== EXTRA CREDIT: Reverse a string ===========\n");
char str1[] = "Hello";
struct stack * str_stack1 = newStack(sizeof(str1));
printf("Heap Memory in use: %lu\n", memory_used);
printf("%s => ", str1);
stringReverse(str1, str_stack1);
printf("%s\n", str1);
char str2[] = "";
struct stack * str_stack2 = newStack(sizeof(str2));
printf("Heap Memory in use: %lu\n", memory_used);
printf("%s => ", str2);
stringReverse(str2, str_stack2);
printf("%s\n", str2);
char str3[] = "Computer Science";
struct stack * str_stack3 = newStack(sizeof(str3));
printf("Heap Memory in use: %lu\n", memory_used);
printf("%s => ", str3);
stringReverse(str3, str_stack3);
printf("%s\n", str3);
deleteStack(str_stack1);
deleteStack(str_stack2);
deleteStack(str_stack3);
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Extra Credit passed\n");
#endif
/******************** Test #12 **************************/
printf("\n=========== Test # 12: Clean up memory ===========\n");
deleteStack(s);
s = NULL;
deleteStack(rand_stack);
rand_stack = NULL;
printf("Heap Memory in use: %lu\n", memory_used);
printf("\t...Test #12 passed\n");
printf("All tests passed! Don't forget to submit to MyCourses.\n");
#if EXTRA
printf("========== evaluate for EXTRA CREDIT ===========\n\n");
#endif
} 提问时把问题讲清楚，复制了这么多代码也不知道到底要干嘛，谁有那个功夫猜你代码实现什么功能。你把要求说了我们才能回答，或者指出你程序里的错误啊。
页:
[1]