LeetCode problem : Reverse Nodes in k-Group

Problem

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.

If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is.

You may not alter the values in the nodes, only nodes itself may be changed.

Only constant memory is allowed.

For example,
Given this linked list: 1->2->3->4->5

For k = 2, you should return: 2->1->4->3->5

For k = 3, you should return: 3->2->1->4->5

Code

ListNode *reverseKGroup(ListNode *head, int k) {
    // Note: The Solution object is instantiated only once and is reused by each test case.
    if(!head)
        return 0;
    ListNode *first = head;
    stack<ListNode *> st;
    int i = 0;
    ListNode *last = first;
    for(int i = 0;i < k;++i){
        if(last)
            st.push(last);
        else
            return first;
        last = last->next;
    }
    ListNode *prev = st.top();
    st.pop();
    ListNode *topNode = prev;
    while(!st.empty()){
        ListNode *curr = st.top();
        st.pop();
        prev->next = curr;
        prev = curr;
    }
    first->next = reverseKGroup(last,k);
    return topNode;
}