Skip to content

feat: menambahkan studi kasus stack #15

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
yusuf601 merged 1 commit into from
Sep 3, 2025
Merged

feat: menambahkan studi kasus stack #15

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Empty file added case_study/readme.md
View file
Open in desktop
Empty file.
133 changes: 133 additions & 0 deletions case_study/use_array.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,133 @@
#include <iostream>
#include <string>
#include <stdexcept>
class Stack{
private://abstraksi dynamic array
int size;
int capacity;
char* arr;
private:
std::string s;
public:
//default constructor
Stack()noexcept{
this->capacity = 1;
this->size = 0;
this->s = "";
this->arr = new char[capacity];
}
//constructor
Stack(int capacity,std::string s){
this->capacity = capacity;
this->size = 0;
this->s = s;
this->arr = new char[capacity];
}
private: //method valid parantheses
bool is_open(char bracket){
if(bracket == '{'){
return true;
}
if(bracket == '('){
return true;
}
if(bracket == '['){
return true;
}
return false;
}
bool is_close(char bracket){
if(bracket == '}'){
return true;
}
if(bracket == ')'){
return true;
}
if(bracket == ']'){
return true;
}
return false;
}
bool is_matching(char open,char close){
if(open == '{' && close == '}'){
return true;
}
if(open == '(' && close == ')'){
return true;
}
if(open == '[' && close == ']'){
return true;
}
return false;
}
std::string parser(){
std::string res;
for(int i = 0;i < this->s.size();i++){
if(isalnum(s[i])){
res.push_back(s[i]);
}
}
return res;
}
private://getter stack
char top()const noexcept{
return arr[size - 1];
}
bool is_empty()const noexcept{
if(size == 0){
return true;
}
return false;
}
private:
void push(const char& bracket)noexcept{
arr[size] = bracket;
size++;
}
void pop(){
if(size == 0){
throw std::runtime_error("Stack kosong");
}
arr[size - 1] = 0;
size--;
}
public:
bool valid_parantheses(){
std::string res = parser();
for(int i = 0;i < res.size();i++){
if(is_open(res[i])){
//push ke stack
arr[size] = res[i];
size++;
}else if(is_close(res[i])){
//jika kosong maka tidak ada pasangan
if(is_empty()){
return false;
}
//jika tidak matching langsung return false
if(!is_matching(arr[size - 1],res[i])){
return false;
}
//pop jika matching
arr[size - 1] = 0;
size--;
}
}
return true;
}
void result(){
if(valid_parantheses()){
std::cout << "Bracket valid" << std::endl;
}else{
std::cout << "Bracket tidak valid" << std::endl;
}

}
};
int main(){
Stack* stack1 = new Stack(100,"(a+b)");
stack1->result();
// Your code here
std::cin.get();
return 0;
}
Loading