Commit a1ee509

committed

stype: optimize code

1 parent ed31ec2 commit a1ee509Copy full SHA for a1ee509

File tree

+31

-1

lines changed

+31

-1

lines changed

Lines changed: 31 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,34 @@`
`1`	`1`	`//`
`2`		`-// Created by denghuilong on 2022年7月31日.`
	`2`	`+// Created by DHL on 2022年7月31日.`
`3`	`3`	`//`
`4`	`4`
	`5`	`+class Solution {`
	`6`	`+public:`
	`7`	`+ vector<int> relativeSortArray(vector<int> &arr1, vector<int> &arr2) {`
	`8`	`+ int len = 1001;`
	`9`	`+ int *result = new int[len]();`
	`10`	`+ int alen = arr1.size();`
	`11`	`+ for (int i = 0; i < alen; i++) {`
	`12`	`+ result[arr1[i]]++;`
	`13`	`+ }`
	`14`	`+`
	`15`	`+ int index = 0;`
	`16`	`+ int blen = arr2.size();`
	`17`	`+ for (int i = 0; i < blen; i++) {`
	`18`	`+ int key = arr2[i];`
	`19`	`+ while (result[key] > 0) {`
	`20`	`+ arr1[index++] = key;`
	`21`	`+ result[key]--;`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+`
	`25`	`+ for (int i = 0; i < len; i++) {`
	`26`	`+ while (result[i] > 0) {`
	`27`	`+ arr1[index++] = i;`
	`28`	`+ result[i]--;`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+ delete[] result;`
	`32`	`+ return arr1;`
	`33`	`+ }`
	`34`	`+};`

Comments

(0)