Commita22402e

authored

Merge pull requestneetcode-gh#2243 from Jay-0331/rust/0621-task-scheduler

Create: 0621-task-scheduler.rs

2 parents5f2ac6f +d5c9f5d commita22402eCopy full SHA for a22402e

File tree

+34

-0

lines changed

+34

-0

lines changed

Lines changed: 34 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,34 @@`
	`1`	`+use std::collections::{BinaryHeap,VecDeque,HashMap};`
	`2`	`+`
	`3`	`+implSolution{`
	`4`	`+pubfnleast_interval(tasks:Vec<char>,n:i32) ->i32{`
	`5`	`+letmut count =HashMap::new();`
	`6`	`+letmut max_heap =BinaryHeap::new();`
	`7`	`+for taskin tasks{`
	`8`	`+let count = count.entry(task).or_insert(0);`
	`9`	`+*count +=1;`
	`10`	`+}`
	`11`	`+for(key, val)in count.iter(){`
	`12`	`+ max_heap.push(*val);`
	`13`	`+}`
	`14`	`+letmut time =0;`
	`15`	`+letmut deque:VecDeque<(i32,i32)> =VecDeque::new();`
	`16`	`+while deque.len() >0 \|\| max_heap.len() >0{`
	`17`	`+ time +=1;`
	`18`	`+`
	`19`	`+if max_heap.len() ==0{`
	`20`	`+ time = deque[0].1;`
	`21`	`+}`
	`22`	`+else{`
	`23`	`+let cnt = max_heap.pop().unwrap() -1;`
	`24`	`+if cnt !=0{`
	`25`	`+ deque.push_back((cnt, time + n));`
	`26`	`+}`
	`27`	`+}`
	`28`	`+if deque.len() >0 && deque[0].1 == time{`
	`29`	`+ max_heap.push(deque.pop_front().unwrap().0);`
	`30`	`+}`
	`31`	`+}`
	`32`	`+ time`
	`33`	`+}`
	`34`	`+}`

Comments

(0)