Node* push(Node* top, int x) {
Node* n = new Node; // Memory allocation
if (!n) { // or (n == NULL)
cout << "Stack overflow" << endl;
return top;
}
n->data = x;
n->next = top;
top = n;
return top;
}
class Solution { public int removeDuplicates ( int [] nums ) { // base case: return if array have no el. if ( nums...
No comments:
Post a Comment