Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Stack
//Title of this code #include <iostream> struct Node { int data; Node* next; Node(int d, Node *n) : data(d), next(n) {} }; class Stack { Node *lifoList; Node *sortedList; Stack(){} ~Stack(){} void push(int d) {} int pop() {} }; int main() { std::cout << "Hello, world!\n"; }
run
|
edit
|
history
|
help
0
My love
cache 内存消耗
Cuantos
OperatorOverload2
Shultz_Lab1.CPP
Maximum product subarray
.
without HLD range Quey can be handled by just using segment tree on the FLATTENED TREE (euler tour)
OneANOVA
GenericPacker