File tree 2 files changed +3
-2
lines changed
src/main/java/com/fishercoder/solutions 2 files changed +3
-2
lines changed Original file line number Diff line number Diff line change @@ -306,7 +306,7 @@ Your ideas/fixes/algorithms are more than welcome!
306
306
| 279| [ Perfect Squares] ( https://leetcode.com/problems/perfect-squares/ ) | [ Solution] ( ../master/src/main/java/com/fishercoder/solutions/PerfectSquares.java ) | O(n)| O(1) | Medium|
307
307
|278|[ First Bad Version] ( https://leetcode.com/problems/first-bad-version/ ) |[ Solution] ( ../master/src/main/java/com/fishercoder/solutions/FirstBadVersion.java ) | O(logn)|O(1) | Easy| Binary Search
308
308
| 277| [ Find the Celebrity] ( https://leetcode.com/problems/find-the-celebrity/ ) | [ Solution] ( ../master/src/main/java/com/fishercoder/solutions/FindtheCelebrity.java ) | O(n)| O(1) | Medium|
309
- |276|[ Paint Fence] ( https://leetcode.com/problems/paint-fence/ ) |[ Solution] ( ../master/src/main/java/com/fishercoder/solutions/PaintFence .java ) | O(n)|O(1) | Easy| DP
309
+ |276|[ Paint Fence] ( https://leetcode.com/problems/paint-fence/ ) |[ Solution] ( ../master/src/main/java/com/fishercoder/solutions/_276 .java ) | O(n)|O(1) | Easy| DP
310
310
|275|[ H-Index II] ( https://leetcode.com/problems/h-index-ii/ ) |[ Solution] ( ../master/src/main/java/com/fishercoder/solutions/_275.java ) | O(logn)|O(1) | Medium| Binary Search
311
311
| 274| [ H-Index] ( https://leetcode.com/problems/h-index/ ) | [ Solution] ( ../master/src/main/java/com/fishercoder/solutions/_274.java ) | O(nlogn)| O(1) | Medium|
312
312
|273|[ Integer to English Words] ( https://leetcode.com/problems/integer-to-english-words/ ) |[ Solution] ( ../master/src/main/java/com/fishercoder/solutions/_273.java ) | O(n)|O(1) | Hard| Math, String
Original file line number Diff line number Diff line change 8
8
9
9
Note:
10
10
n and k are non-negative integers.*/
11
- public class PaintFence {
11
+
12
+ public class _276 {
12
13
public int numWays (int n , int k ) {
13
14
if (n == 0 ) return 0 ;
14
15
else if (n == 1 ) return k ;
You can’t perform that action at this time.
0 commit comments