Commit 6deccd4

authored

Update 2471.Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level.cpp

1 parent 380b4f0 commit 6deccd4Copy full SHA for 6deccd4

File tree

-4

lines changed

Greedy/2471.Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level
- 2471.Minimum-Number-of-Operations-to-Sort-a-Binary-Tree-by-Level.cpp

-4

lines changed

Lines changed: 5 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -19,18 +19,19 @@ class Solution {`
`19`	`19`	`int count = 0;`
`20`	`20`	`for (int t=0; t<=maxDepth; t++)`
`21`	`21`	`{`
`22`		`- auto sorted = level[t];`
	`22`	`+ auto& nums = level[t];`
	`23`	`+ auto sorted = nums;`
`23`	`24`	`sort(sorted.begin(), sorted.end());`
`24`	`25`	`unordered_map<int,int>rank;`
`25`	`26`	`for (int i=0; i<sorted.size(); i++)`
`26`	`27`	`rank[sorted[i]] = i;`
`27`	`28`
`28`		`- int n = level[t].size();`
	`29`	`+ int n = nums.size();`
`29`	`30`	`for (int i=0; i<n; i++)`
`30`	`31`	`{`
`31`		`- while (rank[level[t][i]] != i)`
	`32`	`+ while (rank[nums[i]] != i)`
`32`	`33`	`{`
`33`		`- swap(level[t][i], level[t][rank[level[t][i]]]);`
	`34`	`+ swap(nums[i], level[t][rank[nums[i]]]);`
`34`	`35`	`count++;`
`35`	`36`	`}`
`36`	`37`	`}`

Comments

(0)