struct Node *reverse_list(struct Node *head) {
struct Node *prev = NULL;
struct Node *current = head;
struct Node *next = NULL;
while (current != NULL) {
next = current->next;
current->next = prev;
prev = current;
current = next;
}
return prev;
}
If your cursor is on the first character of this function, and you run da}, it will delete the inner curly brace while loop. In regular vim, it would delete the outer. Note da { would work correctly.
If your cursor is on the first character of this function, and you run da}, it will delete the inner curly brace while loop. In regular vim, it would delete the outer. Note da { would work correctly.