Leetcode 318. Maximum Product of Word Lengths

题目

Given a string array words, find the maximum value of length(word[i]) * length(word[j]) where the two words do not share common letters. You may assume that each word will contain only lower case letters. If no such two words exist, return 0.

Example 1:

Given ["abcw", "baz", "foo", "bar", "xtfn", "abcdef"]
Return 16
The two words can be "abcw", "xtfn".

Example 2:

Given ["a", "ab", "abc", "d", "cd", "bcd", "abcd"]
Return 4
The two words can be "ab", "cd".

Example 3:

Given ["a", "aa", "aaa", "aaaa"]
Return 0
No such pair of words.

分析

题目意思是说有N枚骰子， 求他们扔出来的和是M的概率,概率的表示方式是百分比的形式(去掉%并保留两位小数)假设用s[n][m]表示投了n枚骰子，他们扔出来的和是m，我们将每投1枚骰子作为一个子过程，那么假设最后一次投的骰子数是k，那么s[n][m]是不是可以表示为s[n][m] = s[n-1][m-k]+k, k的取值范围是1到6，依次类推，第n-1次投骰子也如此，因此可以得到下面这个递推式子： s[n][m] = s[n-1][m-k]+k（m-k>0），那么再算出投n枚骰子可能出现的情况，将他们相除就得到正确答案

代码

#include <stdio.h>
#include <cmath>
int p[1000][1000]= {0};
int main() {
    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= 6; ++i) p[1][i] = 1;
    for (int i = 2; i <= n; ++i) {
        for (int j = i; j <= m; ++j) {
            for (int k = 1; k <= 6; ++k) {
                if (j - k > 0) {
                    p[i][j] = p[i][j] + (p[i-1][j-k] * p[1][k]);
                }
            }
        }
    }
    int number = p[n][m];
    double result = (number / pow(6, n)) * 100;
    printf("%.2f", 100 * result);
    return 0;
}