From 9d6c29348c8c9233ebafe22d8a323b8d098f02af Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 20:30:02 +0530 Subject: [PATCH 01/10] Update Solution.cpp --- .../0031.Next Permutation/Solution.cpp | 38 +++++++++++-------- 1 file changed, 23 insertions(+), 15 deletions(-) diff --git a/solution/0000-0099/0031.Next Permutation/Solution.cpp b/solution/0000-0099/0031.Next Permutation/Solution.cpp index 72ee758652311..b527d7b3a4f0c 100644 --- a/solution/0000-0099/0031.Next Permutation/Solution.cpp +++ b/solution/0000-0099/0031.Next Permutation/Solution.cpp @@ -1,20 +1,28 @@ class Solution { -public: - void nextPermutation(vector &nums) { - int len = nums.size(); + public: + void nextPermutation(vector < int > & nums) { + int i, j; + int n = nums.size(); + int a = 0; - if (len == 0)return; - int i,j; - for(i = len - 2;i>=0;i--){ - if(nums[i+1] > nums[i]){ - for(j = len - 1;j>i;j--){ - if(nums[j]>nums[i])break; - } - swap(nums[i],nums[j]); - reverse(nums.begin()+i+1,nums.end()); - return; + for (i = n - 2; i >= 0; i--) { + if (nums[i] < nums[i + 1]) { + break; + } + } + + if (i < 0) + reverse(nums.begin(), nums.end()); + + else { + for (j = n - 1; j >= 0; j--) { + if (nums[i] < nums[j]) { + break; + } + } + + swap(nums[i], nums[j]); + reverse(nums.begin() + i + 1, nums.end()); } } - reverse(nums.begin(),nums.end()); - } }; From f4095fd538ff1596879f7c01c8c128adb42a711e Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 20:31:10 +0530 Subject: [PATCH 02/10] Update README.md --- .../0000-0099/0031.Next Permutation/README.md | 35 ++++++++++++++++--- 1 file changed, 31 insertions(+), 4 deletions(-) diff --git a/solution/0000-0099/0031.Next Permutation/README.md b/solution/0000-0099/0031.Next Permutation/README.md index e1d7bb0c9cc22..ce996edf62317 100644 --- a/solution/0000-0099/0031.Next Permutation/README.md +++ b/solution/0000-0099/0031.Next Permutation/README.md @@ -78,10 +78,37 @@ ``` -### **...** - -``` - +### **C++** + +```cpp +class Solution { + public: + void nextPermutation(vector < int > & nums) { + int i, j; + int n = nums.size(); + int a = 0; + + for (i = n - 2; i >= 0; i--) { + if (nums[i] < nums[i + 1]) { + break; + } + } + + if (i < 0) + reverse(nums.begin(), nums.end()); + + else { + for (j = n - 1; j >= 0; j--) { + if (nums[i] < nums[j]) { + break; + } + } + + swap(nums[i], nums[j]); + reverse(nums.begin() + i + 1, nums.end()); + } + } +}; ``` From add4a15f3443c0e9b008948d0b00eacc50864a73 Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 20:31:36 +0530 Subject: [PATCH 03/10] Update README_EN.md --- .../0031.Next Permutation/README_EN.md | 35 ++++++++++++++++--- 1 file changed, 31 insertions(+), 4 deletions(-) diff --git a/solution/0000-0099/0031.Next Permutation/README_EN.md b/solution/0000-0099/0031.Next Permutation/README_EN.md index 0ccd4611fde20..e018f72216923 100644 --- a/solution/0000-0099/0031.Next Permutation/README_EN.md +++ b/solution/0000-0099/0031.Next Permutation/README_EN.md @@ -68,10 +68,37 @@ ``` -### **...** - -``` - +### **C++** + +```cpp +class Solution { + public: + void nextPermutation(vector < int > & nums) { + int i, j; + int n = nums.size(); + int a = 0; + + for (i = n - 2; i >= 0; i--) { + if (nums[i] < nums[i + 1]) { + break; + } + } + + if (i < 0) + reverse(nums.begin(), nums.end()); + + else { + for (j = n - 1; j >= 0; j--) { + if (nums[i] < nums[j]) { + break; + } + } + + swap(nums[i], nums[j]); + reverse(nums.begin() + i + 1, nums.end()); + } + } +}; ``` From 580fb9a1f36189b355f348b89bdf3bf3087cf9a6 Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 20:32:42 +0530 Subject: [PATCH 04/10] Updated cpp solution --- solution/0000-0099/0031.Next Permutation/Solution.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/solution/0000-0099/0031.Next Permutation/Solution.cpp b/solution/0000-0099/0031.Next Permutation/Solution.cpp index b527d7b3a4f0c..f817451e320a3 100644 --- a/solution/0000-0099/0031.Next Permutation/Solution.cpp +++ b/solution/0000-0099/0031.Next Permutation/Solution.cpp @@ -1,5 +1,5 @@ class Solution { - public: +public: void nextPermutation(vector < int > & nums) { int i, j; int n = nums.size(); From d48fd74fd247077cf58d64db497b9a1e38bbec54 Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 22:25:25 +0530 Subject: [PATCH 05/10] remove unused variable --- solution/0000-0099/0031.Next Permutation/README.md | 1 - 1 file changed, 1 deletion(-) diff --git a/solution/0000-0099/0031.Next Permutation/README.md b/solution/0000-0099/0031.Next Permutation/README.md index ce996edf62317..4cdd98bc1c891 100644 --- a/solution/0000-0099/0031.Next Permutation/README.md +++ b/solution/0000-0099/0031.Next Permutation/README.md @@ -86,7 +86,6 @@ class Solution { void nextPermutation(vector < int > & nums) { int i, j; int n = nums.size(); - int a = 0; for (i = n - 2; i >= 0; i--) { if (nums[i] < nums[i + 1]) { From 71bdb1a9ba684cf89dafe227c1e115287fe82ff3 Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 22:25:49 +0530 Subject: [PATCH 06/10] remove unused variable --- solution/0000-0099/0031.Next Permutation/README_EN.md | 1 - 1 file changed, 1 deletion(-) diff --git a/solution/0000-0099/0031.Next Permutation/README_EN.md b/solution/0000-0099/0031.Next Permutation/README_EN.md index e018f72216923..b63be97fc5f9b 100644 --- a/solution/0000-0099/0031.Next Permutation/README_EN.md +++ b/solution/0000-0099/0031.Next Permutation/README_EN.md @@ -76,7 +76,6 @@ class Solution { void nextPermutation(vector < int > & nums) { int i, j; int n = nums.size(); - int a = 0; for (i = n - 2; i >= 0; i--) { if (nums[i] < nums[i + 1]) { From b895e9efb2d94610b41eb9384511723bf26ef834 Mon Sep 17 00:00:00 2001 From: Aldrin Marz7! <53973174+Dhoni77@users.noreply.github.com> Date: Sun, 3 Apr 2022 22:26:16 +0530 Subject: [PATCH 07/10] remove unused variable --- solution/0000-0099/0031.Next Permutation/Solution.cpp | 1 - 1 file changed, 1 deletion(-) diff --git a/solution/0000-0099/0031.Next Permutation/Solution.cpp b/solution/0000-0099/0031.Next Permutation/Solution.cpp index f817451e320a3..e67fc6e097775 100644 --- a/solution/0000-0099/0031.Next Permutation/Solution.cpp +++ b/solution/0000-0099/0031.Next Permutation/Solution.cpp @@ -3,7 +3,6 @@ class Solution { void nextPermutation(vector < int > & nums) { int i, j; int n = nums.size(); - int a = 0; for (i = n - 2; i >= 0; i--) { if (nums[i] < nums[i + 1]) { From 0fe5940eee04431ab9141049cc3ff91504b5ecd0 Mon Sep 17 00:00:00 2001 From: Yang Libin Date: Mon, 4 Apr 2022 09:13:42 +0800 Subject: [PATCH 08/10] Update README.md --- .../0000-0099/0031.Next Permutation/README.md | 38 +++++++++---------- 1 file changed, 17 insertions(+), 21 deletions(-) diff --git a/solution/0000-0099/0031.Next Permutation/README.md b/solution/0000-0099/0031.Next Permutation/README.md index 4cdd98bc1c891..a1f808a6ea7af 100644 --- a/solution/0000-0099/0031.Next Permutation/README.md +++ b/solution/0000-0099/0031.Next Permutation/README.md @@ -82,31 +82,27 @@ ```cpp class Solution { - public: - void nextPermutation(vector < int > & nums) { - int i, j; - int n = nums.size(); - - for (i = n - 2; i >= 0; i--) { - if (nums[i] < nums[i + 1]) { - break; - } +public: + void nextPermutation(vector& nums) { + int i, j; + int n = nums.size(); + for (i = n - 2; i >= 0; i--) { + if (nums[i] < nums[i + 1]) { + break; } - - if (i < 0) - reverse(nums.begin(), nums.end()); - - else { - for (j = n - 1; j >= 0; j--) { - if (nums[i] < nums[j]) { - break; - } + } + if (i < 0) + reverse(nums.begin(), nums.end()); + else { + for (j = n - 1; j >= 0; j--) { + if (nums[i] < nums[j]) { + break; } - - swap(nums[i], nums[j]); - reverse(nums.begin() + i + 1, nums.end()); } + swap(nums[i], nums[j]); + reverse(nums.begin() + i + 1, nums.end()); } + } }; ``` From 30d516d1d6763604d4d18be8bb08846ac6304eea Mon Sep 17 00:00:00 2001 From: Yang Libin Date: Mon, 4 Apr 2022 09:14:05 +0800 Subject: [PATCH 09/10] Update README_EN.md --- .../0031.Next Permutation/README_EN.md | 38 +++++++++---------- 1 file changed, 17 insertions(+), 21 deletions(-) diff --git a/solution/0000-0099/0031.Next Permutation/README_EN.md b/solution/0000-0099/0031.Next Permutation/README_EN.md index b63be97fc5f9b..857767ac78786 100644 --- a/solution/0000-0099/0031.Next Permutation/README_EN.md +++ b/solution/0000-0099/0031.Next Permutation/README_EN.md @@ -72,31 +72,27 @@ ```cpp class Solution { - public: - void nextPermutation(vector < int > & nums) { - int i, j; - int n = nums.size(); - - for (i = n - 2; i >= 0; i--) { - if (nums[i] < nums[i + 1]) { - break; - } +public: + void nextPermutation(vector& nums) { + int i, j; + int n = nums.size(); + for (i = n - 2; i >= 0; i--) { + if (nums[i] < nums[i + 1]) { + break; } - - if (i < 0) - reverse(nums.begin(), nums.end()); - - else { - for (j = n - 1; j >= 0; j--) { - if (nums[i] < nums[j]) { - break; - } + } + if (i < 0) + reverse(nums.begin(), nums.end()); + else { + for (j = n - 1; j >= 0; j--) { + if (nums[i] < nums[j]) { + break; } - - swap(nums[i], nums[j]); - reverse(nums.begin() + i + 1, nums.end()); } + swap(nums[i], nums[j]); + reverse(nums.begin() + i + 1, nums.end()); } + } }; ``` From 9f75472c1a86e145a915698672fd17ff6f0fb35e Mon Sep 17 00:00:00 2001 From: Yang Libin Date: Mon, 4 Apr 2022 09:14:20 +0800 Subject: [PATCH 10/10] Update Solution.cpp --- .../0031.Next Permutation/Solution.cpp | 36 +++++++++---------- 1 file changed, 16 insertions(+), 20 deletions(-) diff --git a/solution/0000-0099/0031.Next Permutation/Solution.cpp b/solution/0000-0099/0031.Next Permutation/Solution.cpp index e67fc6e097775..5385d4333668c 100644 --- a/solution/0000-0099/0031.Next Permutation/Solution.cpp +++ b/solution/0000-0099/0031.Next Permutation/Solution.cpp @@ -1,27 +1,23 @@ class Solution { public: - void nextPermutation(vector < int > & nums) { - int i, j; - int n = nums.size(); - - for (i = n - 2; i >= 0; i--) { - if (nums[i] < nums[i + 1]) { - break; - } + void nextPermutation(vector& nums) { + int i, j; + int n = nums.size(); + for (i = n - 2; i >= 0; i--) { + if (nums[i] < nums[i + 1]) { + break; } - - if (i < 0) - reverse(nums.begin(), nums.end()); - - else { - for (j = n - 1; j >= 0; j--) { - if (nums[i] < nums[j]) { - break; - } + } + if (i < 0) + reverse(nums.begin(), nums.end()); + else { + for (j = n - 1; j >= 0; j--) { + if (nums[i] < nums[j]) { + break; } - - swap(nums[i], nums[j]); - reverse(nums.begin() + i + 1, nums.end()); } + swap(nums[i], nums[j]); + reverse(nums.begin() + i + 1, nums.end()); } + } };