Posts tagged as “dp”

花花酱 LeetCode 321. Create Maximum Number

By zxi on November 14, 2017

Problem:

Given two arrays of length m and n with digits 0-9 representing two numbers. Create the maximum number of length k <= m + n from digits of the two. The relative order of the digits from the same array must be preserved. Return an array of the k digits. You should try to optimize your time and space complexity.

Example 1:

nums1 = [3, 4, 6, 5]
nums2 = [9, 1, 2, 5, 8, 3]
k = 5
return [9, 8, 6, 5, 3]

Example 2:

nums1 = [6, 7]
nums2 = [6, 0, 4]
k = 5
return [6, 7, 6, 0, 4]

Example 3:

nums1 = [3, 9]
nums2 = [8, 9]
k = 3
return [9, 8, 9]

题目大意：给你两个数字数组和k，返回从两个数组中选取k个数字能够组成的最大值。

Idea: Greedy + DP

Solution:

Time complexity: O(k * (n1+n2)^2)

Space complexity: O(n1+n2)

C++

// Author: Huahua

// Runtime: 26 ms

class Solution {

public:

vector<int> maxNumber(vector<int>& nums1, vector<int>& nums2, int k) {

vector<int> ans;

const int n1 = nums1.size();

const int n2 = nums2.size();

for (int i = max(0, k - n2); i <= min(k, n1); ++i)

ans = max(ans, maxNumber(maxNumber(nums1, i),

maxNumber(nums2, k - i)));

return ans;

}

private:

vector<int> maxNumber(const vector<int>& nums, int k) {

vector<int> ans(k);

int j = 0;

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

while (j > 0 && nums[i] > ans[j - 1]

&& nums.size() - i > k - j) --j;

if (j < k) ans[j++] = nums[i];

}

return ans;

}

vector<int> maxNumber(const vector<int>& nums1, const vector<int>& nums2) {

vector<int> ans(nums1.size() + nums2.size());

auto s1 = nums1.cbegin();

auto e1 = nums1.cend();

auto s2 = nums2.cbegin();

auto e2 = nums2.cend();

int index = 0;

while (s1 != e1 || s2 != e2)

ans[index++] =

lexicographical_compare(s1, e1, s2, e2) ? *s2++ : *s1++;

return ans;

}

};

Java

// Author: Huahua

// Runtime: 18 ms

class Solution {

public int[] maxNumber(int[] nums1, int[] nums2, int k) {

int[] best = new int[0];

for (int i = Math.max(0, k - nums2.length);

i <= Math.min(k, nums1.length); ++i)

best = max(best, 0,

maxNumber(maxNumber(nums1, i),

maxNumber(nums2, k - i)), 0);

return best;

}

private int[] maxNumber(int[] nums, int k) {

int[] ans = new int[k];

int j = 0;

for (int i = 0; i < nums.length; ++i) {

while (j > 0 && nums[i] > ans[j - 1]

&& nums.length - i > k - j) --j;

if (j < k)

ans[j++] = nums[i];

}

return ans;

}

private int[] maxNumber(int[] nums1, int[] nums2) {

int[] ans = new int[nums1.length + nums2.length];

int s1 = 0;

int s2 = 0;

int index = 0;

while (s1 != nums1.length || s2 != nums2.length)

ans[index++] = max(nums1, s1, nums2, s2) == nums1 ?

nums1[s1++] : nums2[s2++];

return ans;

}

private int[] max(int[] nums1, int s1, int[] nums2, int s2) {

for (int i = s1; i < nums1.length; ++i) {

int j = s2 + i - s1;

if (j >= nums2.length) return nums1;

if (nums1[i] < nums2[j]) return nums2;

if (nums1[i] > nums2[j]) return nums1;

}

return nums2;

}

花花酱 LeetCode 724. Find Pivot Index

By zxi on November 13, 2017

Problem:

Given an array of integers nums, write a method that returns the “pivot” index of this array.

We define the pivot index as the index where the sum of the numbers to the left of the index is equal to the sum of the numbers to the right of the index.

If no such index exists, we should return -1. If there are multiple pivot indexes, you should return the left-most pivot index.

Example 1:

Input:

nums = [1, 7, 3, 6, 5, 6]

Output: 3

Explanation:

The sum of the numbers to the left of index 3 (nums[3] = 6) is equal to the sum of numbers to the right of index 3.

Also, 3 is the first index where this occurs.

Example 2:

Input:

nums = [1, 2, 3]

Output: -1

Explanation:

There is no index that satisfies the conditions in the problem statement.

Note:

The length of nums will be in the range [0, 10000].
Each element nums[i] will be an integer in the range [-1000, 1000].

Idea:

Solution:

C++

// Author: Huahua

// Runtime: 43 ms

class Solution {

public:

int pivotIndex(vector<int>& nums) {

const int sum = accumulate(nums.begin(), nums.end(), 0);

int l = 0;

int r = sum;

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

r -= nums[i];

if (l == r) return i;

l += nums[i];

}

return -1;

}

};

Java

// Author: Huahua

// Runtime: 133 ms

class Solution {

public int pivotIndex(int[] nums) {

int sum = IntStream.of(nums).sum();

int l = 0;

int r = sum;

for (int i = 0; i < nums.length; ++i) {

r -= nums[i];

if (l == r) return i;

l += nums[i];

}

return -1;

}

Python

"""

Author: Huahua

Runtime: 112 ms

"""

class Solution:

def pivotIndex(self, nums):

l, r = 0, sum(nums)

for i in range(len(nums)):

r -= nums[i]

if l == r: return i

l += nums[i]

return -1

花花酱 LeetCode 91. Decode Ways

By zxi on November 9, 2017

题目大意：

给你一个加密的数字字符串，问你一共有多少种不同的解密方式。

Problem:

A message containing letters from A-Z is being encoded to numbers using the following mapping:

‘A’ -> 1

‘B’ -> 2

…

‘Z’ -> 26

Given an encoded message containing digits, determine the total number of ways to decode it.

For example,
Given encoded message "12", it could be decoded as "AB" (1 2) or "L" (12).

The number of ways decoding "12" is 2.

Idea:

Dynamic Programming

Solution:

C++

Time complexity: O(n^2)

Space complexity: O(n^2)

// Author: Huahua

// Runtime: 6 ms

class Solution {

public:

int numDecodings(string s) {

if(s.length() == 0) return 0;

m_ways[""] = 1;

return ways(s);

}

private:

int ways(const string& s) {

if (m_ways.count(s)) return m_ways[s];

if (s[0] == '0') return 0;

if (s.length() == 1) return 1;

int w = ways(s.substr(1));

const int prefix = stoi(s.substr(0, 2));

if (prefix <= 26)

w += ways(s.substr(2));

m_ways[s] = w;

return w;

}

unordered_map<string, int> m_ways;

};

C++

Time complexity: O(n)

Space complexity: O(n)

// Author: Huahua

// Runtime: 3 ms

class Solution {

public:

int numDecodings(string s) {

if(s.length() == 0) return 0;

return ways(s, 0, s.length() - 1);

}

private:

int ways(const string& s, int l, int r) {

if (m_ways.count(l)) return m_ways[l];

if (s[l] == '0') return 0;

if (l >= r) return 1; // Single digit or empty.

int w = ways(s, l + 1, r);

const int prefix = (s[l] - '0') * 10 + (s[l + 1] - '0');

if (prefix <= 26)

w += ways(s, l + 2, r);

m_ways[l] = w;

return w;

}

// Use l as key.

unordered_map<int, int> m_ways;

};

C++

Time complexity: O(n)

Space complexity: O(1)

class Solution {

public:

int numDecodings(string s) {

if (s.empty() || s[0] == '0') return 0;

if (s.length() == 1) return 1;

const int n = s.length();

int w1 = 1;

int w2 = 1;

for (int i = 1; i < n; ++i) {

int w = 0;

if (!isValid(s[i]) && !isValid(s[i - 1], s[i])) return 0;

if (isValid(s[i])) w = w1;

if (isValid(s[i - 1], s[i])) w += w2;

w2 = w1;

w1 = w;

}

return w1;

}

private:

bool isValid(const char c) { return c != '0'; }

bool isValid(const char c1, const char c2) {

const int num = (c1 - '0')*10 + (c2 - '0');

return num >= 10 && num <= 26;

}

};

Related Problems:

[解题报告] LeetCode 639. Decode Ways II – 花花酱

花花酱 LeetCode 72. Edit Distance

By zxi on October 15, 2017

Problem:

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

You have the following 3 operations permitted on a word:

a) Insert a character
b) Delete a character
c) Replace a character

Idea:

Dynamic Programming

Solution:

Recursive

// Author: Huahua

// Runtime: 13 ms

class Solution {

public:

int minDistance(string word1, string word2) {

int l1 = word1.length();

int l2 = word2.length();

d_ = vector<vector<int>>(l1 + 1, vector<int>(l2 + 1, -1));

return minDistance(word1, word2, l1, l2);

}

private:

vector<vector<int>> d_;

// minDistance from word1[0:l1-1] to word2[0:l2-1]

int minDistance(const string& word1, const string& word2, int l1, int l2) {

if (l1 == 0) return l2;

if (l2 == 0) return l1;

if (d_[l1][l2] >= 0) return d_[l1][l2];

int ans;

if (word1[l1 - 1] == word2[l2 - 1])

ans = minDistance(word1, word2, l1 - 1, l2 - 1);

else

ans = min(minDistance(word1, word2, l1 - 1, l2 - 1),

min(minDistance(word1, word2, l1 - 1, l2),

minDistance(word1, word2, l1, l2 - 1))) + 1;

return d_[l1][l2] = ans;

}

};

Iterative

// Author: Huahua

// Runtime: 9 ms

class Solution {

public:

int minDistance(string word1, string word2) {

int l1 = word1.length();

int l2 = word2.length();

// d[i][j] := minDistance(word1[0:i - 1], word2[0:j - 1]);

vector<vector<int>> d(l1 + 1, vector<int>(l2 + 1, 0));

for (int i = 0; i <= l1; ++i)

d[i][0] = i;

for (int j = 0; j <= l2; ++j)

d[0][j] = j;

for (int i = 1; i <= l1; ++i)

for (int j = 1; j <= l2; ++j) {

int c = (word1[i - 1] == word2[j - 1]) ? 0 : 1;

d[i][j] = min(d[i - 1][j - 1] + c,

min(d[i][j - 1], d[i - 1][j]) + 1);

}

return d[l1][l2];

}

};

花花酱 688. Knight Probability in Chessboard

By zxi on October 1, 2017

https://leetcode.com/problems/knight-probability-in-chessboard/description/

Problem:

On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly Kmoves. The rows and columns are 0 indexed, so the top-left square is (0, 0), and the bottom-right square is (N-1, N-1).

A chess knight has 8 possible moves it can make, as illustrated below. Each move is two squares in a cardinal direction, then one square in an orthogonal direction.

Each time the knight is to move, it chooses one of eight possible moves uniformly at random (even if the piece would go off the chessboard) and moves there.

The knight continues moving until it has made exactly K moves or has moved off the chessboard. Return the probability that the knight remains on the board after it has stopped moving.

Example:

Input: 3, 2, 0, 0

Output: 0.0625

Explanation: There are two moves (to (1,2), (2,1)) that will keep the knight on the board.

From each of those positions, there are also two moves that will keep the knight on

the board. The total probability the knight stays on the board is 0.0625.

Note:

N will be between 1 and 25.
K will be between 0 and 100.
The knight always initially starts on the board.

Idea:

Dynamic programming

Count the ways to reach (x, y) after k moves from start.

Time Complexity: O(k*n^2)

Space Complexity: O(n^2)

Solution:

// Author: Huahua

// Runtime: 6 ms

class Solution {

public:

double knightProbability(int N, int K, int r, int c) {

vector<vector<double>> dp0(N, vector<double>(N, 0.0));

dp0[r][c] = 1.0;

int dirs[8][2] = {{1, 2}, {-1, -2}, {1, -2}, {-1, 2},

{2, 1}, {-2, -1}, {2, -1}, {-2, 1}};

for (int k = 0; k < K; ++k) {

vector<vector<double>> dp1(N, vector<double>(N, 0.0));

for (int i = 0; i < N; ++i)

for (int j = 0; j < N; ++j)

for (int m = 0; m < 8; ++m) {

int x = j + dirs[m][0];

int y = i + dirs[m][1];

if (x < 0 || y < 0 || x >= N || y >= N) continue;

dp1[i][j] += dp0[y][x];

}

std::swap(dp0, dp1);

}

double total = 0;

for (int i = 0; i < N; ++i)

for (int j = 0; j < N; ++j)

total += dp0[i][j];

return total / pow(8, K);

}

};

Related problems: