Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit8ff4074

Browse files
refactor 276
1 parent92c77c3 commit8ff4074

File tree

1 file changed

+0
-12
lines changed
  • src/main/java/com/fishercoder/solutions

1 file changed

+0
-12
lines changed

‎src/main/java/com/fishercoder/solutions/_276.java

Lines changed: 0 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -1,17 +1,5 @@
11
packagecom.fishercoder.solutions;
22

3-
/**
4-
* 276. Paint Fence
5-
6-
There is a fence with n posts, each post can be painted with one of the k colors.
7-
8-
You have to paint all the posts such that no more than two adjacent fence posts have the same color.
9-
10-
Return the total number of ways you can paint the fence.
11-
12-
Note:
13-
n and k are non-negative integers.*/
14-
153
publicclass_276 {
164
publicstaticclassSolution1 {
175
publicintnumWays(intn,intk) {

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp