2 Star 3 Fork 11

启明南/stack-engine

Create your Gitee Account
Explore and code with more than 12 million developers,Free private repositories !:)
Sign up
文件
This repository doesn't specify license. Please pay attention to the specific project description and its upstream code dependency when using it.
Clone or Download
main.cpp 1.26 KB
Copy Edit Raw Blame History
启明南 authored 2021-01-17 06:23 . stack替换为自实现的
#include <iostream>
#include "include/common.h"
#include "include/javaThread.h"
#include "include/localVariableTable.h"
#include "container/stack.h"
int main() {
JavaThread javaThread(1024);
javaThread.run();
return 0;
}
//int main() {
// Stack<int> stack(2);
//
// stack.push(10);
// stack.push(20);
//// stack.push(30);
//
//// std::cout << stack.top() << std::endl;
//
// std::cout << "=====" << std::endl;
//
// std::cout << stack.popData() << std::endl;
// std::cout << stack.popData() << std::endl;
//
// std::cout << "=====" << std::endl;
//
// stack.push(10);
// stack.push(20);
//
// std::cout << stack.popData() << std::endl;
// std::cout << stack.popData() << std::endl;
//
// return 0;
//}
//int main() {
// double v = 100;
//
// int d[2];
//
// int* tmp = (int *)&v;
//
// *d = *tmp;
// *(d + 1) = *(tmp + 1);
//
// double* tt = (double *)d;
//
// printf("%0.1f\n", *tt);
//
// return 0;
//}
//int main() {
// array<int, 5> data;
//
// data[0] = 1;
//
// cout << data[0] << endl;
//
// return 0;
//}
//int main() {
// stack<int>* stack = new std::stack<int>;
//
// stack->push(11);
// stack->push(12);
//
// std::cout << stack->size() << std::endl;
//
// return 0;
//}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C++
1
https://gitee.com/luban-ziya/stack-engine.git
git@gitee.com:luban-ziya/stack-engine.git
luban-ziya
stack-engine
stack-engine
master

Search