LeetCode 之哈希表 map

1. Longest Consecutive Sequence

Given an unsorted array of integers, find the length of the longest consecutive elements sequence.

For example,
Given [100, 4, 200, 1, 3, 2],
The longest consecutive elements sequence is [1, 2, 3, 4]. Return its length: 4.

Your algorithm should run in O(n) complexity.

1. 由于题目要求复杂度为O(n), 所以用一般的排序算法行不通。想到用哈希表

steps:

1. 由所给数组创建表结构map[num[i], value]

2. 扫描数组元素num[i]，如果存在

如果num[i]---继续存在，这是左边的长度

如果num[i]++继续存在，这是右边的长度

3. 比较两边长度sum 与 当前保存的长度

C++实现如下

int longestConsecutive(vector<int> &num) {
    unordered_map<int, int> contentMap;
    for(int i=0; i<num.size(); i++)
        contentMap[num[i]] = 1;
    int result = 0;
    for(int i=0; i<num.size();i++){
        if(contentMap[num[i]]==1){

            int len =1;
            int left = num[i]-1;
            int right = num[i]+1;
            while(contentMap[left]){
                contentMap[left--] = 0;
                len++;

            }
            while(contentMap[right]){
                len++;
                contentMap[right++] = 0;
            }
            if(len>result) result = len;
        }
    }
    return result;
}

java 实现如下：

public int longestConsecutive(int[] num) {
        int result = 0;
        Set<Integer> contentMap = new HashSet<Integer>();
        for(int i=0; i<num.length; i++){
        	contentMap.add(num[i]);
        }
        for(int i=0; i<num.length; i++){
        	if(contentMap.contains(num[i])){
        		int len = 1;
        		int left = num[i]-1;
        		int right = num[i]+1;
        		while(contentMap.contains(left)){
        			contentMap.remove(left);
        			len++;
        			left--;
        		}
        		while(contentMap.contains(right)){
        			contentMap.remove(right);
        			len++;
        			right++;
        		}
        		if(len>result)
        			result = len;
        	}
        }
        return result;
    }

2. Anagrams

Given an array of strings, return all groups of strings that are anagrams.

Note: All inputs will be in lower-case.

思路： 采用map记录string 出现的次数，将排序后的字符串作为key 存储在map中

vector<string> anagrams(vector<string> &strs) {
    vector<string> result;
    map<string,int> temp;
    for(int i=0; i<strs.size();i++){//record string frequence
        string str = strs[i];
        sort(str.begin(),str.end());
        if(temp.find(str) == temp.end()){
            temp[str] = 1;
        }
        else{
            temp[str]++;
        }
    }
    for(int i=0; i<strs.size();i++){// find all group anagram
        string str = strs[i];
        sort(str.begin(),str.end());
        if(temp.find(str) != temp.end() && temp[str]>1){
            result.push_back(strs[i]);
        }
    }
    return result;
}

3. 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 they add up to the target, where index1 must be less than index2. Please note that your returned answers (both index1 and index2) are not zero-based.

You may assume that each input would have exactly one solution.

Input: numbers={2, 7, 11, 15}, target=9
Output: index1=1, index2=2

用map, 将numbers中的数值和对应下标存起来，然后再扫描一遍numbers，并在map中找到另一半

复杂度O(n)

vector<int> twoSum(vector<int> &numbers, int target) {
    map<int,int> mapping;
    vector<int> result;
    for(int i=0;i<numbers.size();i++){
        mapping[numbers[i]] = i;
    }
    for(int i=0;i<numbers.size();i++){
        int searched = target-numbers[i];
        if(mapping.find(searched)!=mapping.end()){//find the element
            if(i<mapping[searched]){
                result.push_back(i+1);
                result.push_back(mapping[searched]+1);
                return result;
            }
            if(i>mapping[searched]){
                result.push_back(mapping[searched]+1);
                result.push_back(i+1);
                return result;
            }
        }
    }
    return result;
}

4.

未完待续