W

@will_kf617

f640

C++
2 years ago
#include<bits/stdc++.h> using namespace std; int eval(){ string s; cin>>s; if(s=="f"){ int x=eval();

d221

C++
2 years ago
#include <bits/stdc++.h> using namespace std; int main(){ int n, num, small1, small2; while(cin>>n){ priority_queue<int, vector<int>, greater<int>> pq;

f698(錯的)

C++
2 years ago
#include<bits/stdc++.h> using namespace std; int main(){ stack<int> num; string s; while(cin>>s){ int first = num.top(); num.pop();

b838

C++
2 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int T; cin>>T; while(T--){

f698 錯的

C++
2 years ago
#include <bits/stdc++.h> using namespace std; int main(){ string token; stack<int> operand; while(cin>>token){ if(token=="+" || token=="-" || token=="*" || token=="/"){

e155

C++
2 years ago
#include <bits/stdc++.h> using namespace std; int main(){ int N; while(cin>>N && N!=0){ queue<int> card; vector<int> discard;

e541

C++
2 years ago
#include<bits/stdc++.h> using namespace std; int main(){ int N, Q; int CASE=0; while(cin>>N>>Q&&(N||Q)){ cout<<"CASE# "<<++CASE<<":\n";

parenthesis_linklist

C
2 years ago
//411440281 Lu-Wei-Yi #include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Node *NodePtr; typedef struct Node{ int pos; char symb; NodePtr next;

linkedqueue_using_stack_function

C
2 years ago
//linked stack -> linked queue #include <stdio.h> #include <stdlib.h> #include <time.h> // Enumeration for flags typedef enum { FROM_FRONT, FROM_BACK

linkedstack_using_queue_function

C
2 years ago
//linked stack -> linked queue #include <stdio.h> #include <stdlib.h> #include <time.h> // Enumeration for flags typedef enum { FROM_FRONT, FROM_BACK

trees_link

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> #define SIZE 10 // Tree node structure typedef struct _Node *NodePtr; typedef struct _Node { int data;

trees_array

C
2 years ago
//print_array 函數 // //功能：打印一維數組的元素。 //參數：arr - 要打印的數組，n - 數組的大小。 //返回值：無。 //preorder 函數 // //功能：執行二叉樹數組的先序遍歷並打印元素。 //參數：arr - 二叉樹數組，i - 當前節點索引，n - 數組大小。 //返回值：無。

linkedlist_BasicFunction

C
2 years ago
#include <stdio.h> #include <stdlib.h> #include <time.h> // Define List Node typedef struct _Node *NodePtr; typedef struct _Node { int data; // Store value of the node NodePtr next; // Store address of the next node } Node;

第四次作業_part2_初始版

C
2 years ago
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Node *NodePtr; typedef struct Node{ int data; NodePtr next; }Node;

非全域變數

C
2 years ago
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Node *NodePtr; typedef struct Node{ int pos; char symb; NodePtr next; }Node;

DataStructure_HW4_parenthesis match_全域變數

C
2 years ago
#include<stdio.h> #include<stdlib.h> #include<time.h> typedef struct Node *NodePtr; typedef struct Node{ int pos; char symb; NodePtr next; }Node;

Test

C
2 years ago
#include <stdio.h> int returnvalue(int a){ a=a+1; return a; } int main() { int a=0; returnvalue(a);

DataStructure_Week12_HW

C
2 years ago
#include <stdio.h> typedef struct listNode *listPointer; typedef struct { int posotion; char symbol; listPointer link; }listNode;

DataStructure_LinklistPactice

C
2 years ago
#include <stdio.h> #include <stdlib.h> typedef struct{ int number; struct linklist *next; }Node; Node *head; //head = [int][NULL]

Queue

C
2 years ago
#include <stdio.h> struct{ A[sizei] } int main() { printf("Hello world!\n"); return 0; }