花花酱 LeetCode 470. Implement Rand10() Using Rand7()

By zxi on October 15, 2018

Problem

Given a function rand7 which generates a uniform random integer in the range 1 to 7, write a function rand10 which generates a uniform random integer in the range 1 to 10.

Do NOT use system’s Math.random().

Example 1:

Input: 1
Output: [7]

Example 2:

Input: 2
Output: [8,4]

Example 3:

Input: 3
Output: [8,1,10]

Note:

rand7 is predefined.
Each testcase has one argument: n, the number of times that rand10 is called.

Follow up:

What is the expected value for the number of calls to rand7() function?
Could you minimize the number of calls to rand7()?

Solution:

Time complexity: O(1)

Space complexity: O(1)

C++

// Author: Huahua

class Solution {

public:

int rand10() {

int index = INT_MAX;

while (index >= 40)

index = 7 * (rand7() - 1) + (rand7() - 1);

return index % 10 + 1;

}

};

花花酱 LeetCode 922. Sort Array By Parity II

By zxi on October 13, 2018

Problem

Given an array A of non-negative integers, half of the integers in A are odd, and half of the integers are even.

Sort the array so that whenever A[i] is odd, i is odd; and whenever A[i] is even, i is even.

You may return any answer array that satisfies this condition.

Example 1:

Input: [4,2,5,7]
Output: [4,5,2,7]
Explanation: [4,7,2,5], [2,5,4,7], [2,7,4,5] would also have been accepted.

Note:

2 <= A.length <= 20000
A.length % 2 == 0
0 <= A[i] <= 1000

Solution 1: Brute Force

Time complexity: O(n)

Space complexity: O(n)

C++

// Author: Huahua

class Solution {

public:

vector<int> sortArrayByParityII(vector<int>& A) {

vector<int> evens;

vector<int> odds;

for (int a : A)

if (a % 2 == 0)

evens.push_back(a);

else

odds.push_back(a);

auto it1 = begin(evens);

auto it2 = begin(odds);

for (int i = 0; i < A.size(); ++i) {

A[i] = *it1++;

swap(it1, it2);

}

return A;

}

};

花花酱 LeetCode 921. Minimum Add to Make Parentheses Valid

By zxi on October 13, 2018

Given a string S of '(' and ')' parentheses, we add the minimum number of parentheses ( '(' or ')', and in any positions ) so that the resulting parentheses string is valid.

Formally, a parentheses string is valid if and only if:

It is the empty string, or
It can be written as AB (A concatenated with B), where A and B are valid strings, or
It can be written as (A), where A is a valid string.

Given a parentheses string, return the minimum number of parentheses we must add to make the resulting string valid.

Example 1:

Input: "())"
Output: 1

Example 2:

Input: "((("
Output: 3

Example 3:

Input: "()"
Output: 0

Example 4:

Input: "()))(("
Output: 4

Note:

S.length <= 1000
S only consists of '(' and ')' characters.

Solution: Counting

Time complexity: O(n)

Space complexity: O(1)

C++

// Author: Huahua

class Solution {

public:

int minAddToMakeValid(string S) {

int l = 0;

int m = 0;

for (char c : S) {

if (c == '(') ++l;

if (c == ')' && l > 0) {

--l;

++m;

}

return S.size() - m * 2;

}

};

花花酱 LeetCode 923. 3Sum With Multiplicity

By zxi on October 13, 2018

Problem

Given an integer array A, and an integer target, return the number of tuples i, j, k such that i < j < k and A[i] + A[j] + A[k] == target.

As the answer can be very large, return it modulo 10^9 + 7.

Example 1:

Input: A = [1,1,2,2,3,3,4,4,5,5], target = 8
Output: 20
Explanation: 
Enumerating by the values (A[i], A[j], A[k]):
(1, 2, 5) occurs 8 times;
(1, 3, 4) occurs 8 times;
(2, 2, 4) occurs 2 times;
(2, 3, 3) occurs 2 times.

Example 2:

Input: A = [1,1,2,2,2,2], target = 5
Output: 12
Explanation: 
A[i] = 1, A[j] = A[k] = 2 occurs 12 times:
We choose one 1 from [1,1] in 2 ways,
and two 2s from [2,2,2,2] in 6 ways.

Note:

3 <= A.length <= 3000
0 <= A[i] <= 100
0 <= target <= 300

Solution: Math / Combination

Time complexity: O(n + |target|^2)

Space complexity: O(|target|)

C++

// Author: Huahua, runtime: 4 ms

class Solution {

public:

int threeSumMulti(vector<int>& A, int target) {

constexpr int kMaxN = 100;

constexpr int kMod = 1e9 + 7;

vector<long> c(kMaxN + 1, 0);

for (int a : A) ++c[a];

long ans = 0;

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

for (int j = i; j <= target; ++j) {

const int k = target - i - j;

if (k < 0 || k >= c.size() || k < j) continue;

if (!c[i] || !c[j] || !c[k]) continue;

if (i == j && j == k)

ans += (c[i] - 2) * (c[i] - 1) * c[i] / 6;

else if (i == j && j != k)

ans += c[i] * (c[i] - 1) / 2 * c[k];

else if (i != j && j == k)

ans += c[i] * (c[j] - 1) * c[j] / 2;

else

ans += c[i] * c[j] * c[k];

}

return ans % kMod;

}

};

花花酱 LeetCode 924. Minimize Malware Spread

By zxi on October 13, 2018

Problem

In a network of nodes, each node i is directly connected to another node j if and only if graph[i][j] = 1.

Some nodes initial are initially infected by malware. Whenever two nodes are directly connected and at least one of those two nodes is infected by malware, both nodes will be infected by malware. This spread of malware will continue until no more nodes can be infected in this manner.

Suppose M(initial) is the final number of nodes infected with malware in the entire network, after the spread of malware stops.

We will remove one node from the initial list. Return the node that if removed, would minimize M(initial). If multiple nodes could be removed to minimize M(initial), return such a node with the smallest index.

Note that if a node was removed from the initial list of infected nodes, it may still be infected later as a result of the malware spread.

Example 1:

Input: graph = [[1,1,0],[1,1,0],[0,0,1]], initial = [0,1]
Output: 0

Example 2:

Input: graph = [[1,0,0],[0,1,0],[0,0,1]], initial = [0,2]
Output: 0

Example 3:

Input: graph = [[1,1,1],[1,1,1],[1,1,1]], initial = [1,2]
Output: 1

Note:

1 < graph.length = graph[0].length <= 300
0 <= graph[i][j] == graph[j][i] <= 1
graph[i][i] = 1
1 <= initial.length < graph.length
0 <= initial[i] < graph.length

Solution: BFS

Time complexity: O(n^3)

Space complexity: O(n^2)

C++

// Author: Huahua

class Solution {

public:

int minMalwareSpread(vector<vector<int>>& graph, vector<int>& initial) {

int min_affected = INT_MAX;

int min_node = -1;

sort(begin(initial), end(initial));

for (int t : initial) {

vector<int> bad(graph.size(), 0);

queue<int> q;

for (int n : initial)

if (n != t) {

bad[n] = 1;

q.push(n);

}

int affected = initial.size() - 1;

while (!q.empty()) {

int size = q.size();

while (size--) {

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

for (int i = 0; i < graph[n].size(); ++i) {

if (graph[n][i] == 0 || bad[i]) continue;

++affected;

bad[i] = 1;

q.push(i);

}

if (affected < min_affected) {

min_affected = affected;

min_node = t;

}

return min_node;

}

};

Huahua's Tech Road

花花酱 LeetCode 470. Implement Rand10() Using Rand7()

Problem

Solution:

C++

花花酱 LeetCode 922. Sort Array By Parity II

Problem

Solution 1: Brute Force

C++

花花酱 LeetCode 921. Minimum Add to Make Parentheses Valid

Solution: Counting

C++

花花酱 LeetCode 923. 3Sum With Multiplicity

Problem

Solution: Math / Combination

C++

花花酱 LeetCode 924. Minimize Malware Spread

Problem

Solution: BFS

C++