Month: November 2015
Remove Element
Problem:
Given an array and a value, remove all instances of that value in place and return the new length.
The order of elements can be changed. It doesn’t matter what you leave beyond the new length.
Solution:
Idea:
Two pointers i and j. Pointer i is for common elements pointing and counts. Pointer j is for traversing array.
When encountering the common elements, pointer i acts like a counter; when target element, pause counting and continue the traversing.
In Memory of Nausicaa 