Posts published in “Search”

花花酱 LeetCode 40. Combination Sum II

By zxi on October 15, 2017

Problem:

Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

Each number in C may only be used once in the combination.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

For example, given candidate set [10, 1, 2, 7, 6, 1, 5] and target 8,
A solution set is:

[

[1, 7],

[1, 2, 5],

[2, 6],

[1, 1, 6]

]

Idea:

DFS

Solution:

C++ / set

// Author: Huahua

// Runtime: 9 ms

class Solution {

public:

vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {

set<vector<int>> ans;

std::sort(candidates.begin(), candidates.end());

vector<int> curr;

dfs(candidates, target, 0, ans, curr);

return vector<vector<int>>(ans.begin(), ans.end());

}

private:

void dfs(const vector<int>& candidates,

int target, int s,

set<vector<int>>& ans,

vector<int>& curr) {

if (target == 0) {

ans.insert(curr);

return;

}

for (int i = s; i < candidates.size(); ++i) {

int num = candidates[i];

if (num > target) return;

curr.push_back(num);

dfs(candidates, target - num, i + 1, ans, curr);

curr.pop_back();

}

};

C++ / vector

// Author: Huahua

// Runtime: 9ms

class Solution {

public:

vector<vector<int>> combinationSum2(vector<int>& candidates, int target) {

vector<vector<int>> ans;

std::sort(candidates.begin(), candidates.end());

vector<int> curr;

dfs(candidates, target, 0, ans, curr);

return ans;

}

private:

void dfs(const vector<int>& candidates,

int target, int s,

vector<vector<int>>& ans,

vector<int>& curr) {

if (target == 0) {

ans.push_back(curr);

return;

}

for (int i = s; i < candidates.size(); ++i) {

int num = candidates[i];

if (num > target) return;

if (i > s && candidates[i] == candidates[i - 1]) continue;

curr.push_back(num);

dfs(candidates, target - num, i + 1, ans, curr);

curr.pop_back();

}

};

花花酱 LeetCode 488. Zuma Game

By zxi on October 9, 2017

https://leetcode.com/problems/zuma-game/description/

Problem:

Think about Zuma Game. You have a row of balls on the table, colored red(R), yellow(Y), blue(B), green(G), and white(W). You also have several balls in your hand.

Each time, you may choose a ball in your hand, and insert it into the row (including the leftmost place and rightmost place). Then, if there is a group of 3 or more balls in the same color touching, remove these balls. Keep doing this until no more balls can be removed.

Find the minimal balls you have to insert to remove all the balls on the table. If you cannot remove all the balls, output -1.

Examples:
Input: “WRRBBW”, “RB”
Output: -1
Explanation: WRRBBW -> WRR[R]BBW -> WBBW -> WBB[B]W -> WW

Input: “WWRRBBWW”, “WRBRW”
Output: 2
Explanation: WWRRBBWW -> WWRR[R]BBWW -> WWBBWW -> WWBB[B]WW -> WWWW -> empty

Input:“G”, “GGGGG”
Output: 2
Explanation: G -> G[G] -> GG[G] -> empty

Input: “RBYYBBRRB”, “YRBGB”
Output: 3
Explanation: RBYYBBRRB -> RBYY[Y]BBRRB -> RBBBRRB -> RRRB -> B -> B[B] -> BB[B] -> empty

Note:

You may assume that the initial row of balls on the table won’t have any 3 or more consecutive balls with the same color.
The number of balls on the table won’t exceed 20, and the string represents these balls is called “board” in the input.
The number of balls in your hand won’t exceed 5, and the string represents these balls is called “hand” in the input.
Both input strings will be non-empty and only contain characters ‘R’,’Y’,’B’,’G’,’W’.

Idea: Search

Solution1: C++ / Search

// Author: Huahua

// Runtime: 3 ms

class Solution {

public:

int findMinStep(string board, string hand) {

vector<int> h(128, 0);

for (char color : hand) ++h[color];

return dfs(board, h);

}

private:

// Return the min # of balls needed in hand to clear the board.

// Returns -1 if not possible.

int dfs(const string& board, vector<int>& hand) {

if (board.empty()) return 0;

int ans = INT_MAX;

int i = 0;

int j = 0;

while (i < board.size()) {

while (j < board.size() && board[i] == board[j]) ++j;

// board[i] ~ board[j - 1] have the same color

const char color = board[i];

// Number of balls needed to clear board[i] ~ board[j - 1]

const int b = 3 - (j - i);

// Have sufficient balls in hand

if (hand[color] >= b) {

// Remove board[i] ~ board[j - 1] and update the board

string nb = update(board.substr(0, i) + board.substr(j));

// Find the solution on new board with updated hand

hand[color] -= b;

int r = dfs(nb, hand);

if (r >= 0) ans = min(ans, r + b);

// Recover the balls in hand

hand[color] += b;

}

i = j;

}

return ans == INT_MAX ? -1 : ans;

}

// Update the board by removing all consecutive 3+ balls.

// "YWWRRRWWYY" -> "YWWWWYY" -> "YYY" -> ""

string update(string board) {

int i = 0;

while (i < board.size()) {

int j = i;

while (j < board.size() && board[i] == board[j]) ++j;

if (j - i >= 3) {

board = board.substr(0, i) + board.substr(j);

i = 0;

} else {

++i;

}

return board;

}

};

花花酱 LeetCode 39. Combination Sum

By zxi on October 3, 2017

Problem:

Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.

The same repeated number may be chosen from C unlimited number of times.

Note:

All numbers (including target) will be positive integers.
The solution set must not contain duplicate combinations.

For example, given candidate set [2, 3, 6, 7] and target 7,
A solution set is:

[

[7],

[2, 2, 3]

]

Idea:

DFS

Solution: C++

class Solution {

public:

vector<vector<int>> combinationSum(vector<int>& candidates, int target) {

vector<vector<int>> ans;

vector<int> cur;

std::sort(candidates.begin(), candidates.end());

dfs(candidates, target, 0, cur, ans);

return ans;

}

private:

void dfs(vector<int>& candidates, int target, int s, vector<int>& cur, vector<vector<int>>& ans) {

if (target == 0) {

ans.push_back(cur);

return;

}

for (int i = s; i < candidates.size(); ++i) {

if (candidates[i] > target) break;

cur.push_back(candidates[i]);

dfs(candidates, target - candidates[i], i, cur, ans);

cur.pop_back();

}

};

Python

"""

Author: Huahua

Runtime: 75 ms (batter than 97.04%)

"""

class Solution(object):

def combinationSum(self, candidates, target):

def dfs(candidates, target, s, curr, ans):

if target == 0:

ans.append(curr[:])

return

for i in xrange(s, len(candidates)):

if candidates[i] > target: return

curr.append(candidates[i])

dfs(candidates, target - candidates[i], i, curr, ans)

curr.pop()

ans = []

candidates.sort()

dfs(candidates, target, 0, [], ans);

return ans

花花酱 LeetCode 690. Employee Importance

By zxi on September 28, 2017

https://leetcode.com/problems/employee-importance/description/

Problem:

ou are given a data structure of employee information, which includes the employee’s unique id, his importance value and his direct subordinates’ id.

For example, employee 1 is the leader of employee 2, and employee 2 is the leader of employee 3. They have importance value 15, 10 and 5, respectively. Then employee 1 has a data structure like [1, 15, [2]], and employee 2 has [2, 10, [3]], and employee 3 has [3, 5, []]. Note that although employee 3 is also a subordinate of employee 1, the relationship is not direct.

Now given the employee information of a company, and an employee id, you need to return the total importance value of this employee and all his subordinates.

Example 1:

Input: [[1, 5, [2, 3]], [2, 3, []], [3, 3, []]], 1

Output: 11

Explanation:

Employee 1 has importance value 5, and he has two direct subordinates: employee 2 and employee 3. They both have importance value 3.

So the total importance value of employee 1 is 5 + 3 + 3 = 11.

Note:

One employee has at most one direct leader and may have several subordinates.
The maximum number of employees won’t exceed 2000.

Idea:

BFS / DFS

Time complexity: O(n)

Space complexity: O(n)

Solution:

C++ / BFS

// Author: Huahua

// Running time: 13 ms

class Solution {

public:

int getImportance(vector<Employee*> employees, int id) {

unordered_map<int, Employee*> es;

for (auto e : employees)

es.emplace(e->id, e);

queue<int> q;

q.push(id);

int sum = 0;

while (!q.empty()) {

int eid = q.front(); q.pop();

auto e = es[eid];

sum += e->importance;

for (auto rid : e->subordinates)

q.push(rid);

}

return sum;

}

};

C++ / DFS

class Solution {

public:

int getImportance(vector<Employee*> employees, int id) {

unordered_map<int, Employee*> es;

for (auto e : employees)

es.emplace(e->id, e);

return dfs(id, es);

}

private:

int dfs(int id, const unordered_map<int, Employee*>& es) {

const auto e = es.at(id);

int sum = e->importance;

for (int rid : e->subordinates)

sum += dfs(rid, es);

return sum;

}

};

花花酱 LeetCode 126. Word Ladder II

By zxi on September 26, 2017

Problem:

Given two words (beginWord and endWord), and a dictionary’s word list, find all shortest transformation sequence(s) from beginWord to endWord, such that:

Only one letter can be changed at a time
Each transformed word must exist in the word list. Note that beginWord is not a transformed word.

For example,

Given:
beginWord = "hit"
endWord = "cog"
wordList = ["hot","dot","dog","lot","log","cog"]

Return

[

["hit","hot","dot","dog","cog"],

["hit","hot","lot","log","cog"]

]

Note:

Return an empty list if there is no such transformation sequence.
All words have the same length.
All words contain only lowercase alphabetic characters.
You may assume no duplicates in the word list.
You may assume beginWord and endWord are non-empty and are not the same.

Idea:

BFS to construct the graph + DFS to extract the paths

Solutions:

C++, BFS 1

// Author: Huahua

// Running Time: 216 ms (better than 65.42%)

class Solution {

public:

vector<vector<string>> findLadders(string beginWord, string endWord, vector<string>& wordList) {

unordered_set<string> dict(wordList.begin(), wordList.end());

if (!dict.count(endWord)) return {};

dict.erase(beginWord);

dict.erase(endWord);

unordered_map<string, int> steps{{beginWord, 1}};

unordered_map<string, vector<string>> parents;

queue<string> q;

q.push(beginWord);

vector<vector<string>> ans;

const int l = beginWord.length();

int step = 0;

bool found = false;

while (!q.empty() && !found) {

++step;

for (int size = q.size(); size > 0; size--) {

const string p = q.front(); q.pop();

string w = p;

for (int i = 0; i < l; i++) {

const char ch = w[i];

for (int j = 'a'; j <= 'z'; j++) {

if (j == ch) continue;

w[i] = j;

if (w == endWord) {

parents[w].push_back(p);

found = true;

} else {

// Not a new word, but another transform

// with the same number of steps

if (steps.count(w) && step < steps.at(w))

parents[w].push_back(p);

}

if (!dict.count(w)) continue;

dict.erase(w);

q.push(w);

steps[w] = steps.at(p) + 1;

parents[w].push_back(p);

}

w[i] = ch;

}

if (found) {

vector<string> curr{endWord};

getPaths(endWord, beginWord, parents, curr, ans);

}

return ans;

}

private:

void getPaths(const string& word,

const string& beginWord,

const unordered_map<string, vector<string>>& parents,

vector<string>& curr,

vector<vector<string>>& ans) {

if (word == beginWord) {

ans.push_back(vector<string>(curr.rbegin(), curr.rend()));

return;

}

for (const string& p : parents.at(word)) {

curr.push_back(p);

getPaths(p, beginWord, parents, curr, ans);

curr.pop_back();

}

};

C++ / BFS 2

// Author: Huahua

// Running time: 129 ms (better than 80.67%)

class Solution {

public:

vector<vector<string>> findLadders(string beginWord, string endWord, vector<string>& wordList) {

vector<vector<string>> ans;

unordered_set<string> dict(wordList.begin(), wordList.end());

if (!dict.count(endWord)) return ans;

dict.erase(endWord);

const int l = beginWord.length();

unordered_set<string> q{beginWord}, p;

unordered_map<string, vector<string>> children;

bool found = false;

while (!q.empty() && !found) {

for (const string& word : q)

dict.erase(word);

for (const string& word : q) {

string curr = word;

for (int i = 0; i < l; i++) {

char ch = curr[i];

for (int j = 'a'; j <= 'z'; j++) {

curr[i] = j;

if (curr == endWord) {

found = true;

children[word].push_back(curr);

} else if (dict.count(curr) && !found) {

p.insert(curr);

children[word].push_back(curr);

}

curr[i] = ch;

}

std::swap(p, q);

p.clear();

}

if (found) {

vector<string> path{beginWord};

getPaths(beginWord, endWord, children, path, ans);

}

return ans;

}

private:

void getPaths(const string& word,

const string& endWord,

const unordered_map<string, vector<string>>& children,

vector<string>& path,

vector<vector<string>>& ans) {

if (word == endWord) {

ans.push_back(path);

return;

}

const auto it = children.find(word);

if (it == children.cend()) return;

for (const string& child : it->second) {

path.push_back(child);

getPaths(child, endWord, children, path, ans);

path.pop_back();

}

};

C++ / Bidirectional BFS

// Author: Huahua

// Running time: 39 ms (better than 93.74%)

class Solution {

public:

vector<vector<string>> findLadders(string beginWord, string endWord, vector<string>& wordList) {

vector<vector<string>> ans;

unordered_set<string> dict(wordList.begin(), wordList.end());

if (!dict.count(endWord)) return ans;

int l = beginWord.length();

unordered_set<string> q1{beginWord};

unordered_set<string> q2{endWord};

unordered_map<string, vector<string>> children;

bool found = false;

bool backward = false;

while (!q1.empty() && !q2.empty() && !found) {

// Always expend the smaller queue first

if (q1.size() > q2.size()) {

std::swap(q1, q2);

backward = !backward;

}

for (const string& w : q1)

dict.erase(w);

for (const string& w : q2)

dict.erase(w);

unordered_set<string> q;

for (const string& word : q1) {

string curr = word;

for (int i = 0; i < l; i++) {

char ch = curr[i];

for (int j = 'a'; j <= 'z'; j++) {

curr[i] = j;

const string* parent = &word;

const string* child = &curr;

if (backward)

std::swap(parent, child);

if (q2.count(curr)) {

found = true;

children[*parent].push_back(*child);

} else if (dict.count(curr) && !found) {

q.insert(curr);

children[*parent].push_back(*child);

}

curr[i] = ch;

}

std::swap(q, q1);

}

if (found) {

vector<string> path{beginWord};

getPaths(beginWord, endWord, children, path, ans);

}

return ans;

}

private:

void getPaths(const string& word,

const string& endWord,

const unordered_map<string, vector<string>>& children,

vector<string>& path,

vector<vector<string>>& ans) {

if (word == endWord) {

ans.push_back(path);

return;

}

const auto it = children.find(word);

if (it == children.cend()) return;

for (const string& child : it->second) {

path.push_back(child);

getPaths(child, endWord, children, path, ans);

path.pop_back();

}

};