Skip to main content

The AI Monk

Search This Blog

Dev Ops in 30 Days

on March 26, 2022 Dev Ops

Get link
Facebook
X
Pinterest
Email
Other Apps

47. Permutations II - LeetCode

on January 28, 2019

Get link
Facebook
X
Pinterest
Email
Other Apps

47. Permutations II - LeetCode

My idea is just do a simple backtracking to put the current index to all possible locations:

Get link
Facebook
X
Pinterest
Email
Other Apps

Comments

Post a Comment

Popular Posts

Download Dota 2 Replay data

If you are a Dota 2 player, do you ever wonder how to download your dota 2 replay other than using Dota 2 client itself? Well, it seems like OpenDota has provided us some clue:

A good way to learn about what "basic" the software engineering industry is expected in

A few months ago, I was a bit lost on what I should improve myself for my work. I started sourcing for different good books, and I found a very good book: Yup, it is " Cracking the Coding Interview ". This book is good because it briefly touches the basics of every topic that a company might care about. If you have attended an undergraduate course, you probably have learned them, the questions provided in this book gave you a recap so that you could answer other more advanced questions better. While it is mainly targeted for people who is looking for jobs in big company such as Google and Microsoft, I personally think that it is a good book for any software engineer, because it reminds me to keep my basics sharp even if I am employed. When I first answering the questions in this book, there are a lot of questions that I answered wrongly, so don't be discouraged if you answer questions wrongly: you just have to make sure that you have learnt from the mis...

324. Wiggle Sort II

Wiggle Sort II is a very interesting question that took me a day to solve it. A naive solution is to Sort it, then partition the lower half of the array to the odd indices of the array and upper half of the array to the even indices of the array. However, doing so would give u O(nlogn) solution, but not O(n) solution as the question required. The idea of solving it is to make use of 3-way quick select, to partition the array based on the median. The idea of 3-way quick select: Select a pivot, then partition the array according to the following rules: 1. the leftmost side of the array contains elements that are lesser than the pivot 2. the middle side of the array contains elements that equals to the pivot 3. the rightmost side of the array contains elements that are larger than the pivot Do note that 3-way quick select does not guarantee O(n) time performance, but it gives O(n) average time performance. You can make it to be guarantee O(n) average time performance by ...

Powered by Blogger

Theme images by fpm