ok

NoteXYX · NoteXYX · commit e6830588f5d0 · 2020-09-15T15:12:42.000+08:00
diff --git a/src/com/leetcode/Sort.java b/src/com/leetcode/Sort.java
@@ -12,9 +12,9 @@ public void swap(int[] nums, int posA, int posB) {
     /***************************************冒泡排序******************************************
      * 平均时间复杂度O(n^2)    空间复杂度O(1)    稳定    最差时间复杂度O(n^2)    最好时间复杂度O(n)   */
     public void maopaoSort(int[] nums) {
-        for (int end = nums.length; end > 0; end--) {
-            for (int i = 0; i < end-1; i++) {
-                if (nums[i] > nums[i+1])
+        for (int end = nums.length-1; end > 0; end--) {
+            for (int i = 0; i < end; i++) {
+                if (nums[i+1] < nums[i])
                     swap(nums, i, i+1);
             }
         }

Original file line number	Diff line number	Diff line change
`@@ -12,9 +12,9 @@ public void swap(int[] nums, int posA, int posB) {`
`12`	`12`	`/*************************************冒泡排序****************************************`
`13`	`13`	`* 平均时间复杂度O(n^2) 空间复杂度O(1) 稳定最差时间复杂度O(n^2) 最好时间复杂度O(n) */`
`14`	`14`	`public void maopaoSort(int[] nums) {`
`15`		`- for (int end = nums.length; end > 0; end--) {`
`16`		`- for (int i = 0; i < end-1; i++) {`
`17`		`- if (nums[i] > nums[i+1])`
	`15`	`+ for (int end = nums.length-1; end > 0; end--) {`
	`16`	`+ for (int i = 0; i < end; i++) {`
	`17`	`+ if (nums[i+1] < nums[i])`
`18`	`18`	`swap(nums, i, i+1);`
`19`	`19`	`}`
`20`	`20`	`}`