C/C++ 陣列連結串列表示式計算
國慶期間，自己搞了C/C++編譯環境（cygwin其實比mingw好安裝一些），跟著敲了一些程式碼，記錄一下：
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
/*
* File: main.cpp
* Author: dingcc
*
* Created on 2020年10月6日, 下午10:10
*/
#include <cstdlib>
#include <iostream>
#include <math.h>
using namespace std;
/**
* 尋找兩個單詞的相同字母的節點
*/
typedef struct LNode {
char data;
struct LNode *next;
}LNode;
LNode *findFirstCommon(LNode *str1, LNode *str2)
{
int len1 = 0, len2 = 0;
LNode *p = str1->next, *q = str2->next;
while (p != NULL)
{
len1++;
p = p->next;
}
while (q != NULL)
{
len2++;
q = q->next;
}
for (p=str1->next; len1>len2; len1--)
p=p->next;
for (q=str2->next; len1<len2; len2--)
q=q->next;
while (p !=NULL && p->data != q->data)
{
p = p->next;
q = q->next;
}
cout<<p->data<<endl;
return p;
}
/**
* 尾插法
* @param head
* @param n
* @param length
*/
void createLinkListR(LNode *&head, char n[], int length) {
head = (LNode*) malloc(sizeof(LNode));
head ->next = NULL;
LNode *p = NULL, *r=head;
for (int i=0; i < length; ++i) {
p = (LNode*) malloc(sizeof(LNode));
p ->next = NULL;
p ->data = n[i];
p ->next = r->next;
r ->next = p;
r = p;
}
cout<<head ->next ->data<<endl;
}
/**
* 頭插法
* @param head
* @param n
* @param length
*/
void createLinkListL(LNode *&head, char n[], int length) {
head = (LNode*) malloc(sizeof(LNode));
head ->next = NULL;
LNode *p = NULL;
for (int i=0; i < length; ++i) {
p = (LNode*) malloc(sizeof(LNode));
p ->next = NULL;
p ->data = n[i];
p ->next = head->next;
head ->next = p;
}
cout<<head ->next ->data<<endl;
}
/**
* 合併陣列
* @param a 陣列a
* @param m 陣列a的長度
* @param b 陣列b
* @param n 陣列b的長度
* @param c 合併後的陣列c
*/
void mergearray (int a[], int m, int b[], int n, int c[])
{
int i = 0, j = 0;
int k = 0;
while (i < m && j < n)
{
if (a[i] < b[j])
c[k++] = a[i++]; // c[k] = a[i]; k++; i++;
else
c[k++] = b[j++];
}
while (i < m)
c[k++] = a[i++];
while (j < n)
c[k++] = b[j++];
}
/**
* 合併連結串列
* @param A 連結串列A
* @param B 連結串列B
* @param C 結果連結串列C
*/
void merge(LNode *A, LNode *B, LNode *&C)
{
LNode *p = A->next;
LNode *q = B->next;
LNode *r;
C = A;
C->next = NULL;
free(B);
r = C;
while(p != NULL && q != NULL)
{
if (p ->data <= q ->data)
{
r->next = p; p = p->next;
r = r->next;
}
else
{
r ->next = q; q = q->next;
r = r->next;
}
}
if(p!=NULL) r->next = p;
if(q!=NULL) r->next = q;
}
int getPriority(char op)
{
if (op == '+' || op == '-')
return 0;
else
return 1;
}
/**
* 中綴式轉字尾式
* @param infix
* @param s2
* @param top2
*/
void infixToPostFix(char infix[], char s2[], int &top2)
{
char s1[11]; int top1 = -1;
int i = 0;
while(infix[i] != '\0')
{
if ('0' <= infix[i] && infix[i] <= '9')
{
s2[++top2] = infix[i];
++i;
}
else if (infix[i] == '(')
{
s1[++top1] = '(';
++i;
}
else if (infix[i] == '+' ||
infix[i] == '-' ||
infix[i] == '*' ||
infix[i] == '/')
{
if (top1 == -1 ||
s1[top1] == '(' ||
getPriority(infix[i]) > getPriority(s1[top1]))
{
s1[++top1] = infix[i];
++i;
}
else
s2[++top2] = s1[top1--];
}
else if (infix[i] == ')')
{
while (s1[top1] != '(')
s2[++top2] = s1[top1--];
--top1;
++i;
}
}
while (top1 != -1)
s2[++top2] = s1[top1--];
for (int j = 0; j < 12; j++) {
cout<<s2[j]<<endl;
}
}
int calSub(float opand1, char op, float opand2, float &result)
{
if (op == '+') result = opand1 + opand2;
if (op == '-') result = opand1 - opand2;
if (op == '*') result = opand1 * opand2;
if (op == '/')
{
if (fabs(opand2) < 0.01)
{
return 0;
}
else
{
result = opand1 / opand2;
}
}
return 1;
}
int calStackTopTwo(float s1[], int &top1, char s2[], int &top2)
{
float opnd1, opnd2, result;
char op;
int flag;
opnd2 = s1[top1--];
opnd1 = s1[top1--];
op = s2[top2--];
flag = calSub(opnd1, op, opnd2, result);
if (flag == 0)
cout<<"ERROE"<<endl; // puts("ERROR");
s1[++top1] = result;
return flag;
}
/**
* 中綴表示式計算
* @param exp
* @return
*/
float callInfix(char exp[])
{
int maxSize = 10;
float s1[maxSize]; int top1 = -1;
char s2[maxSize]; int top2 = -1;
int i = 0;
while (exp[i] != '\0')
{
if ('0' <= exp[i] && exp[i] <= '9')
{
s1[++top1] = exp[i] - '0';
++i;
}
else if (exp[i] == '(')
{
s2[++top2] = '(';
++i;
}
else if (exp[i] == '+' ||
exp[i] == '-' ||
exp[i] == '*' ||
exp[i] == '/')
{
if (top2 == -1 ||
s2[top2] == '(' ||
getPriority(exp[i]) > getPriority(s2[top2]))
{
s2[++top2] = exp[i];
++i;
}
else
{
int flag = calStackTopTwo(s1, top1, s2, top2);
if (flag == 0)
return 0;
}
}
else if (exp[i] == ')')
{
while (s2[top2] != '(')
{
int flag = calStackTopTwo(s1, top1, s2, top2);
if (flag == 0)
return 0;
}
--top2;
++i;
}
}
while (top2 != -1)
{
int flag = calStackTopTwo(s1, top1, s2, top2);
if (flag == 0)
return 0;
}
return s1[top1];
}
/**
* 字尾表示式計算
* @param exp
* @return
*/
float calPostFix(char exp[])
{
int maxSize = 10;
float s[maxSize]; int top = -1;
for (int i = 0; exp[i] != '\0'; ++i)
{
if ('0' <= exp[i] && exp[i] <= '9')
s[++top] = exp[i] - '0';
else
{
float opnd1, opnd2, result;
char op;
int flag;
opnd2 = s[top--];
opnd1 = s[top--];
op = exp[i];
flag = calSub(opnd1, op, opnd2, result);
if (flag == 0)
{
cout<<"ERROR"<<endl; //puts("ERROR");
break;
}
s[++top] = result;
}
}
return s[top];
}
/**
* 字首表示式計算
* @param exp
* @param len
* @return
*/
float calPreFix(char exp[], int len)
{
int maxSize = 10;
float s[maxSize]; int top = -1;
for (int i = len -1; i >= 0; --i)
{
if ('0' <= exp[i] && exp[i] <= '9')
s[++top] = exp[i] - '0';
else
{
float opnd1, opnd2, result;
char op;
int flag;
opnd1 = s[top--];
opnd2 = s[top--];
op = exp[i];
flag = calSub(opnd1, op, opnd2, result);
if (flag == 0)
{
cout<<"ERROR"<<endl; //puts("ERROR");
return 0;
}
s[++top] = result;
}
}
return s[top];
}
/**
* 迭代輸出連結串列元素
* @param c
*/
void foo (LNode *c) {
if (c->next->data != '\0') {
cout<<c->next->data<<endl;
foo(c->next);
}
}
/*
*
*/
int main(int argc, char** argv) {
//cout<<"hello world!"<<endl;
//合併陣列
// int a[4] = {1,3,5,7};
// int b[3] = {2,4,6};
// int m = 4, n = 3;
// int c[7];
// mergearray(a, m, b, n, c);
// for (int i=0; i<7; ++i) {
// cout<<c[i]<<endl;
// }
// 合併連結串列
// LNode *A;
// char a[3] = {'a', 'b', 'c'};
// createLinkListR(A, a, 3);
// LNode *B;
// char b[5] = {'d', 'e', 'f', 'g', 'h'};
// createLinkListR(B, b, 5);
// LNode *C;
// merge(A, B, C);
// foo(C);
// 頭插法生成單連結串列
// LNode *p;
// char n[] ="abc";
// createLinkListL(p, n, 3);
// 尾插法生成單連結串列，找兩個單詞相同的第一個字母
// LNode *str1;
// char n[7] = {'l', 'o', 'a', 'd', 'i', 'n', 'g'};
// createLinkListR(str1, n, 7);
// cout<<"str1;"<<str1 ->next->data<<endl;
// LNode *str2;
// char m[5] = {'d', 'o', 'i', 'n', 'g'};
// createLinkListR(str2, m, 5);
// cout<<"str2;"<<str2 ->next->data<<endl;
// LNode *x = findFirstCommon(str1, str2);
// cout<<"x:"<<x->data<<endl;
// 中綴轉字尾表示式
// char infix[] = "(6+(3+5)*2-1)/3";
// char s2[11];
// int top2 = 0;
// infixToPostFix(infix, s2, top2);
// cout<<"top2"<<top2<<endl;
// 中綴、字尾、字首表示式計算
char exp[] = "(6+(3+5)*2-1)/3";
float s1 = callInfix(exp);
cout<<"s1:"<<s1<<endl;
char exp2[] = "635+2*+1-3/";
float s2 = calPostFix(exp2);
cout<<"s2:"<<s2<<endl;
char exp3[] = "/-+6*+35213";
float s3 = calPreFix(exp3, 11);
cout<<"s3:"<<s3<<endl;
return 0;
}程式碼參考：天勤率輝考研
相關文章
- 陣列與連結串列陣列
- 陣列和連結串列陣列
- C++ STL list連結串列C++
- 【C++ 資料結構：連結串列】二刷LeetCode707設計連結串列C++資料結構LeetCode
- 陣列模擬單連結串列陣列
- 可變陣列——連結串列前言陣列
- 資料結構--陣列、單向連結串列、雙向連結串列資料結構陣列
- C++連結串列小冊子C++
- C++陣列的連續性C++陣列
- 線性結構 陣列與連結串列陣列
- day1-陣列和連結串列陣列
- c++虛擬函式實現計算表示式子C++函式
- 聊聊陣列與連結串列，棧與佇列陣列佇列
- leetcode 61 旋轉連結串列 c++LeetCodeC++
- [C++]歸併排序（連結串列描述）C++排序
- #反轉連結串列_C++版 #反轉連結串列_Java版 @FDDLCC++Java
- L2-022 重排連結串列【陣列】陣列
- 反轉連結串列（C++簡單區）C++
- c/c++ 線性表之單向連結串列C++
- 資料結構 - 單連結串列 C++ 實現資料結構C++
- C++資料結構連結串列的基本操作C++資料結構
- 【C++】C++之Lambda表示式C++
- 線性表（陣列、連結串列、佇列、棧）詳細總結陣列佇列
- L2-002 連結串列去重【陣列】陣列
- 面試-陣列和連結串列的區別面試陣列
- C++陣列 字串C++陣列字串
- C++單連結串列遞迴遍歷操作C++遞迴
- C++連結串列常見面試考點C++面試
- C++ Lambda 表示式C++
- 迴圈單連結串列建構函式、解構函式C++實現函式C++
- 資料結構——單連結串列的C++實現資料結構C++
- 陣列模擬雙連結串列，你get到了嗎？陣列
- 陣列模擬單連結串列你會了嗎？陣列
- 關於多項式的加和、乘積可用連結串列和陣列陣列
- 資料結構--單連結串列（通過陣列實現）資料結構陣列
- c/c++ 線性表之雙向迴圈連結串列C++
- c/c++ 線性表之單向迴圈連結串列C++
- 【C++】“反轉連結串列”相關的題目C++