From 52e452db0ed5fde79bf2084f8f41bfeb67b54268 Mon Sep 17 00:00:00 2001
From: yennanliu <f339339@gmail.com>
Date: Sat, 23 Nov 2024 18:16:21 +0800
Subject: [PATCH] update

---
 .../src/main/java/dev/workspace5.java         | 29 ++++++++++++++++++-
 1 file changed, 28 insertions(+), 1 deletion(-)

diff --git a/leetcode_java/src/main/java/dev/workspace5.java b/leetcode_java/src/main/java/dev/workspace5.java
index be861a95..4129bf64 100644
--- a/leetcode_java/src/main/java/dev/workspace5.java
+++ b/leetcode_java/src/main/java/dev/workspace5.java
@@ -3524,7 +3524,7 @@ private TreeNode buildTree(List<Integer> input){
 
     // LC 31
     // https://leetcode.com/problems/next-permutation/description/
-    // 10.49 - 11.20 AM
+    // 5.39 pm - 6.15 pm
     /**
      *
      *   exp 1) [1,2,3] -> [1,3,2]
@@ -3541,9 +3541,36 @@ private TreeNode buildTree(List<Integer> input){
      *
      *   find max val, mo
      *
+     *   ================================
      *
+     *  Idea 2)
      *
+     *   1) from right -> left, find 1st "pivot"
+     *     -> if there is a val bigger than its left
+     *     (if no pivot, means input array already sorted, return directly
      *
+     *
+     *   2) from left -> right, find 1st element that smaller than pivot,
+     *      if found, swap (pivot <---> element)
+     *
+     *   3) reorder (small -> big ?? ) all val on the right-hand side of element
+     *
+     *
+     *
+     *   demo
+     *
+     *  input : [1,2,3]
+     *
+     *   -> [1,2,3] , so pivot is 3
+     *           i
+     *
+     *   -> [1,2,3]   1 < 3, cur = 3
+     *       j
+     *
+     *   -> [1,2,3]  2 < 3, cur = 2
+     *         i
+     *
+     *   -> so, swap 2 and 3 -> [1,3,2]
      */
     public void nextPermutation(int[] nums) {