| 31 | } |
| 32 | |
| 33 | fn num2str_stk(mut num: i32, base: i32) -> String { |
| 34 | let digits: [&str; 16] = ["0","1","2","3","4","5","6","7", |
| 35 | "8","9","A","B","C","D","E","F"]; |
| 36 | |
| 37 | let mut rem_stack = Stack::new(); |
| 38 | while num > 0 { |
| 39 | if num < base { |
| 40 | // 不超过 base 直接入栈 |
| 41 | rem_stack.push(num); |
| 42 | } else { |
| 43 | // 超过 base，余数入栈 |
| 44 | rem_stack.push(num % base); |
| 45 | } |
| 46 | |
| 47 | num /= base; |
| 48 | } |
| 49 | |
| 50 | // 出栈余数并组成字符串 |
| 51 | let mut num_str = "".to_string(); |
| 52 | while !rem_stack.is_empty() { |
| 53 | num_str += digits[rem_stack.pop().unwrap() as usize]; |
| 54 | } |
| 55 | |
| 56 | num_str |
| 57 | } |
| 58 | |
| 59 | fn main() { |
| 60 | let num = 100; |