I used C with linked list to solve this problem.
But there is still some run time errors...
I could not find out them, help, please...
#include <stdio.h>
#include <stdlib.h>
#define MAX 255
typedef struct list_node *list_ptr;
struct list_node {
int data;
list_ptr link;
};
list_ptr create(int ...
Search found 2 matches
- Sat Sep 08, 2012 6:21 am
- Forum: Volume 119 (11900-11999)
- Topic: 11991 - Easy Problem from Rujia Liu?
- Replies: 32
- Views: 16363
- Thu Jul 26, 2012 4:49 pm
- Forum: Volume 6 (600-699)
- Topic: 673 - Parentheses Balance
- Replies: 243
- Views: 79453
Re: 673 - Parentheses Balance
I have gotten WA for many times...
Can anyone help me?
#include <iostream>
using namespace std;
#define MAX 100
int Stack[MAX], top=-1;
int isEmpty();
int isFull();
int Push(char n);
char Pop();
char View();
int length(char data[]);
int main()
{
int N;
while (cin >> N) {
cin.ignore();
char ...
Can anyone help me?
#include <iostream>
using namespace std;
#define MAX 100
int Stack[MAX], top=-1;
int isEmpty();
int isFull();
int Push(char n);
char Pop();
char View();
int length(char data[]);
int main()
{
int N;
while (cin >> N) {
cin.ignore();
char ...