xkfcl的博客

Given an array, each number appears twice except one, find that single one. First thinking is using Hash map, the key is each number and the value is their appearance times. This is a very intui

Given an unsorted array nums, reorder it in-place such that nums[0] = nums[2] .For example, given nums = [3, 5, 2, 1, 6, 4], one possible answer is [1, 6, 2, 5, 3, 4].For the given example,

This problem is easy if we can use divide. The idea is get the product of all numbers and divide each of them to get the result we want. Linear time and constant space.Here we can't use this met

This problem is similar with Two Sum.The solution is easy. Since they are sorted, we only need to get two pointers that point to head and tail respectively. Then move head one if the sum is smaller

Problem Description:A group of two or more people wants to meet and minimize the total travel distance. You are given a 2D grid of values 0 or 1, where each 1 marks the home of someone in the grou

This is a DP problem. Actually, most problems with minimum or maximum are DP. One thing need to notice in this problem is the symmetric. Paint from the first one is equal with paint from the last one.

The recursive method is trivial. Just record the root and go left and go right.To do it iteratively, we need a stack to record the path. We go left until it's null. And pop the back out then go

This problem can also be solved using Hash map and this idea is quite simple on implementation.But how to do it in linear time and constant space? First of all, we know that if we do XOR t

The difference with previous one is: this time we can buy and sell the share multiple times. We can use greedy to solve this problem. Every time, if we have a local minimum, we buy it and sell it at t