edit 313

Author: fishercoder1534

README.md

@@ -269,7 +269,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |316|[Remove Duplicate Letters](https://leetcode.com/problems/remove-duplicate-letters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_316.java)| O(n)|O(1)| Hard| Stack, Recursion, Greedy
 |315|[Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_315.java)| O(?)|O(?)| Hard| Tree
 |314|[Binary Tree Vertical Order Traversal](https://leetcode.com/problems/binary-tree-vertical-order-traversal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_314.java)| O(n)|O(n) | Medium| HashMap, BFS
-|313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/SuperUglyNumber.java)| O(?)|O(?)| Medium| 
+|313|[Super Ugly Number](https://leetcode.com/problems/super-ugly-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_313.java)| O(?)|O(?)| Medium| 
 |312|[Burst Balloons](https://leetcode.com/problems/burst-balloons/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_312.java)| O(?)|O(?)| Hard| DP
 |311|[Sparse Matrix Multiplication](https://leetcode.com/problems/sparse-matrix-multiplication/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_311.java)| O(m*n*l)|O(m*l)| Medium|
 |310|[Minimum Height Trees](https://leetcode.com/problems/minimum-height-trees/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MinimumHeightTrees.java)| ? | ? | Medium|

src/main/java/com/fishercoder/solutions/SuperUglyNumber.java renamed to src/main/java/com/fishercoder/solutions/_313.java

@@ -1,17 +1,20 @@
 package com.fishercoder.solutions;
 
 /**
+ * 313. Super Ugly Number
+ *
  * Write a program to find the nth super ugly number.
- * <p>
- * Super ugly numbers are positive numbers whose all prime factors are in the given prime list primes of size k. For example, [1, 2, 4, 7, 8, 13, 14, 16, 19, 26, 28, 32] is the sequence of the first 12 super ugly numbers given primes = [2, 7, 13, 19] of size 4.
- * <p>
+ * Super ugly numbers are positive numbers whose all prime factors
+ * are in the given prime list primes of size k.
+ * For example, [1, 2, 4, 7, 8, 13, 14, 16, 19, 26, 28, 32]
+ * is the sequence of the first 12 super ugly numbers given primes = [2, 7, 13, 19] of size 4.
  * Note:
  * (1) 1 is a super ugly number for any given primes.
  * (2) The given numbers in primes are in ascending order.
  * (3) 0 < k ≤ 100, 0 < n ≤ 106, 0 < primes[i] < 1000.
  * (4) The nth super ugly number is guaranteed to fit in a 32-bit signed integer.
  */
-public class SuperUglyNumber {
+public class _313 {
 
     public int nthSuperUglyNumber(int n, int[] primes) {
         int[] ret = new int[n];