Commit 84bc377

author

ruislan

committed

solved q2022

1 parent 99036bc commit 84bc377Copy full SHA for 84bc377

File tree

+24

-3

lines changed

+24

-3

lines changed

Lines changed: 1 addition & 0 deletions

Lines changed: 21 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,21 @@`
	`1`	`+use crate::q::Solution;`
	`2`	`+`
	`3`	`+#[allow(unused)]`
	`4`	`+impl Solution {`
	`5`	`+ pub fn construct2_d_array(original: Vec<i32>, m: i32, n: i32) -> Vec<Vec<i32>> {`
	`6`	`+ // 方法1`
	`7`	`+ // 先检查以下m * n 是不是符合条件`
	`8`	`+ // 然后直接处理即可`
	`9`	`+ let l = original.len();`
	`10`	`+ let m = m as usize;`
	`11`	`+ let n = n as usize;`
	`12`	`+ if m * n != l { return vec![]; }`
	`13`	`+ let mut ans = vec![vec![0; n as usize]; m as usize];`
	`14`	`+ for i in 0..m {`
	`15`	`+ for j in 0..n {`
	`16`	`+ ans[i][j] = original[i * n + j];`
	`17`	`+ }`
	`18`	`+ }`
	`19`	`+ ans`
	`20`	`+ }`
	`21`	`+}`

Lines changed: 2 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,7 @@ impl Solution {`
`6`	`6`	`// 方法1`
`7`	`7`	`// 3位算一组,然后每组里面计算百十个,然后外面得到十亿,百万,千`
`8`	`8`	`// 每组里面又分为了20以内(因为英文20以内是单个单词),20-100,以及100以上`
`9`		`- // AC 0ms 2mb`
	`9`	`+ // AC 0ms 2mb 601/601`
`10`	`10`	`let singles = ["", "One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"];`
`11`	`11`	`let teens = ["Ten", "Eleven", "Twelve", "Thirteen", "Fourteen", "Fifteen", "Sixteen", "Seventeen", "Eighteen", "Nineteen"];`
`12`	`12`	`let tens = ["", "Ten", "Twenty", "Thirty", "Forty", "Fifty", "Sixty", "Seventy", "Eighty", "Ninety"];`
`@@ -40,7 +40,7 @@ impl Solution {`
`40`	`40`	`let mut i = 3;`
`41`	`41`	`let mut unit = 1000000000;`
`42`	`42`	`let mut num = num;`
`43`		`- while i < 4 && i >= 0{`
	`43`	`+ while i < 4 {`
`44`	`44`	`let mut cur_num = num / unit;`
`45`	`45`	`if cur_num != 0 {`
`46`	`46`	`num -= cur_num * unit;`

Lines changed: 0 additions & 1 deletion

Comments

(0)