Add solution #31

Author: JoshCrozier

0031-next-permutation.js

@@ -3,9 +3,11 @@
  * https://leetcode.com/problems/next-permutation/
  * Difficulty: Medium
  *
- * Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.
+ * Implement next permutation, which rearranges numbers into the
+ * lexicographically next greater permutation of numbers.
  *
- * If such an arrangement is not possible, it must rearrange it as the lowest possible order (i.e., sorted in ascending order).
+ * If such an arrangement is not possible, it must rearrange it
+ * as the lowest possible order (i.e., sorted in ascending order).
  *
  * The replacement must be in place and use only constant extra memory.
  */
@@ -14,7 +16,7 @@
  * @param {number[]} nums
  * @return {void} Do not return anything, modify nums in-place instead.
  */
- var nextPermutation = function(nums) {
+var nextPermutation = function(nums) {
   let i = nums.length - 2;
 
   while (i >= 0 && nums[i + 1] <= nums[i]) {
@@ -47,4 +49,4 @@ function swap(nums, i, j) {
   const temp = nums[i];
   nums[i] = nums[j];
   nums[j] = temp;
-}
+}