Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). You are given a target value to search. If found in the array return its index, otherwise return -1. You may assume no duplicate exists in the array. … Read more [LeetCode] Search in Rotated Sorted Array (Java)
Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order). The replacement must be in-place, do not allocate extra memory. Here are some examples. Inputs are in the left-hand column and … Read more [LeetCode] Next Permutation (Java)
Divide two integers without using multiplication, division and mod operator. Analysis We can keep subtract divisor from dividend until dividend is smaller than 0, than count the subtract numbers. But it will costs a very long time if the divisor is very small comparing to dividend. Shift can be used to solve this problem. We … Read more [LeetCode] Divide Two Integers (Java)
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Analysis At first I thought this problem was quite easy. We can just pick the smallest one from all heads of lists and then connect it to the final list. But the complexity of this algorithm will be O(n2k), in which … Read more [LeetCode] Merge k Sorted Lists (Java)
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below.
Input:Digit string "23"
Output: ["ad", "ae", "af", "bd", "be", "bf", "cd", "ce", "cf"].
Note: Although the above answer is in lexicographical order, your answer could be in any order you want. Analysis It’s a easy question. But we … Read more [LeetCode] Letter Combinations of a Phone Number (Java)
In LeetCode, there are a set of problems to find the sum of several integers from an array to be a target value. Two Sum Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return indices of the two numbers such that … Read more [LeetCode] Two Sum, 3 Sum, 3 Sum closest and 4 Sum (Java)
We may install some software manually. For example, we can run the Idea Intellij by running idea.sh. But it’s not so convenient. So we can create a shortcut for the problem. Create a Idea.desktop file on the desktop. The content is as follow.
Comment=Idea IntelliJ 13.0
You may need to change the paths in the file and … Read more Create shortcut in Ubuntu
Write a function to find the longest common prefix string amongst an array of strings. Analysis This is a simple problem. We can just check for each position of every string in the string array. But we need to take care of some strings that is shorter than others. Since there is two loops, we … Read more [LeetCode] Longest Common Prefix (Java)