refine the comments

haoel · haoel · commit e8e1847fb624 · 2016-02-29T17:38:33.000+08:00
diff --git a/algorithms/cpp/nextPermutation/nextPermutation.cpp b/algorithms/cpp/nextPermutation/nextPermutation.cpp
@@ -33,11 +33,11 @@
  *    2 1 3 4
  *    ...
  *
- * The pattern as below:
+ * The pattern can be descripted as below:
  *
- *    1) find the first place which num[i-1] < num[i]
- *    2) find the first number from n-1 to i which >= num[i-1]
- *    3) swap the 2) num with num[i-1]
+ *    1) from n-1 to 0, find the first place [i-1] which num[i-1] < num[i]
+ *    2) from n-1 to i, find the first number from n-1 to i which >= num[i-1]
+ *    3) swap the 2) num with the num[i-1]
  *    4) sort the sub-array [i, n) //actuall sort is fine as well
  * 
  * For example:

Original file line number	Diff line number	Diff line change
`@@ -33,11 +33,11 @@`
`33`	`33`	`* 2 1 3 4`
`34`	`34`	`* ...`
`35`	`35`	`*`
`36`		`- * The pattern as below:`
	`36`	`+ * The pattern can be descripted as below:`
`37`	`37`	`*`
`38`		`- * 1) find the first place which num[i-1] < num[i]`
`39`		`- * 2) find the first number from n-1 to i which >= num[i-1]`
`40`		`- * 3) swap the 2) num with num[i-1]`
	`38`	`+ * 1) from n-1 to 0, find the first place [i-1] which num[i-1] < num[i]`
	`39`	`+ * 2) from n-1 to i, find the first number from n-1 to i which >= num[i-1]`
	`40`	`+ * 3) swap the 2) num with the num[i-1]`
`41`	`41`	`* 4) sort the sub-array [i, n) //actuall sort is fine as well`
`42`	`42`	`*`
`43`	`43`	`* For example:`