Welcome to my personal website. I use this space to share some of my thoughts and software that I write in my free time. Sometimes I also publish photos. If you want to get in touch please use LinkedIn or Mastodon.
Given an array nums, delete all items that are equal to val. Return the total number of remaining items and perform the deletion in place.
The solution looks as follows. Initially, k is set to the length of the list. If we remove one element we decrement k by one. The one thing here is that we advance the pointer i only if we don’t remove an element. This is due to the fact that the position of the following elements change if we delete an item from the array.
About the author
Friedrich Ewald is an experienced Software Engineer with a Master's degree in Computer Science. He started this website in late 2015, mostly as a digital business card. He is interested in Go, Python, Ruby, SQL- and NoSQL-databases, machine learning and AI and is experienced in building scalable, distributed systems and micro-services at multiple larger and smaller companies.