forked from rubythonode/javascript-problems-and-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpaint-fence.js
56 lines (50 loc) · 1.13 KB
/
paint-fence.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
/**
* Paint Fence
*
* There is a fence with n posts, each post can be painted with one of the k colors.
*
* You have to paint all the posts such that no more than two adjacent fence posts have the same color.
*
* Return the total number of ways you can paint the fence.
*
* Note:
* n and k are non-negative integers.
*
* Example:
*
* Input: n = 3, k = 2
* Output: 6
* Explanation: Take c1 as color 1, c2 as color 2. All possible ways are:
*
* post1 post2 post3
* ----- ----- ----- -----
* 1 c1 c1 c2
* 2 c1 c2 c1
* 3 c1 c2 c2
* 4 c2 c1 c1
* 5 c2 c1 c2
* 6 c2 c2 c1
*/
/**
* @param {number} n
* @param {number} k
* @return {number}
*/
const numWays = (n, k) => {
if (n === 0) {
return 0;
}
if (n === 1) {
return k;
}
let same = k; // First post
let diff = k * (k - 1); // Second post
// Start from the 3rd post
for (let i = 2; i < n; i++) {
const temp = diff;
diff = (diff + same) * (k - 1);
same = temp;
}
return diff + same;
};
export { numWays };