Commit2182403

committed

Add solution #2826

1 parenteea7b05 commit2182403Copy full SHA for 2182403

File tree

+35

-0

lines changed

+35

-0

lines changed

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -2048,6 +2048,7 @@`
`2048`	`2048`	`2818\|[Apply Operations to Maximize Score](./solutions/2818-apply-operations-to-maximize-score.js)\|Hard\|`
`2049`	`2049`	`2824\|[Count Pairs Whose Sum is Less than Target](./solutions/2824-count-pairs-whose-sum-is-less-than-target.js)\|Easy\|`
`2050`	`2050`	`2825\|[Make String a Subsequence Using Cyclic Increments](./solutions/2825-make-string-a-subsequence-using-cyclic-increments.js)\|Medium\|`
	`2051`	`+2826\|[Sorting Three Groups](./solutions/2826-sorting-three-groups.js)\|Medium\|`
`2051`	`2052`	`2843\|[Count Symmetric Integers](./solutions/2843-count-symmetric-integers.js)\|Easy\|`
`2052`	`2053`	`2845\|[Count of Interesting Subarrays](./solutions/2845-count-of-interesting-subarrays.js)\|Medium\|`
`2053`	`2054`	`2873\|[Maximum Value of an Ordered Triplet I](./solutions/2873-maximum-value-of-an-ordered-triplet-i.js)\|Easy\|`

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+/**`
	`2`	`+ * 2826. Sorting Three Groups`
	`3`	`+ * https://leetcode.com/problems/sorting-three-groups/`
	`4`	`+ * Difficulty: Medium`
	`5`	`+ *`
	`6`	`+ * You are given an integer array nums. Each element in nums is 1, 2 or 3. In each operation,`
	`7`	`+ * you can remove an element from nums. Return the minimum number of operations to make nums`
	`8`	`+ * non-decreasing.`
	`9`	`+ */`
	`10`	`+`
	`11`	`+/**`
	`12`	`+ *@param {number[]} nums`
	`13`	`+ *@return {number}`
	`14`	`+ */`
	`15`	`+varminimumOperations=function(nums){`
	`16`	`+constn=nums.length;`
	`17`	`+constdp=newArray(n+1).fill(0).map(()=>newArray(4).fill(Infinity));`
	`18`	`+dp[0][0]=0;`
	`19`	`+`
	`20`	`+for(leti=0;i<n;i++){`
	`21`	`+for(letprev=0;prev<=3;prev++){`
	`22`	`+for(letcurr=1;curr<=3;curr++){`
	`23`	`+if(curr>=prev){`
	`24`	`+dp[i+1][curr]=Math.min(`
	`25`	`+dp[i+1][curr],`
	`26`	`+dp[i][prev]+(nums[i]===curr ?0 :1)`
	`27`	`+);`
	`28`	`+}`
	`29`	`+}`
	`30`	`+}`
	`31`	`+}`
	`32`	`+`
	`33`	`+returnMath.min(...dp[n].slice(1));`
	`34`	`+};`

Comments

(0)