Largest Merge Of Two Strings LeetCode solution in Rust

1
impl Solution {
2
  pub fn largest_merge(word1: String, word2: String) -> String {
3
    let mut slice1 = word1.as_bytes();
4
    let mut slice2 = word2.as_bytes();
5
    let mut ans = Vec::with_capacity(word1.len() + word2.len());
6
    while !slice1.is_empty() && !slice2.is_empty() {
7
      if slice1 > slice2 {
8
        ans.push(slice1[0]);
9
        slice1 = &slice1[1..];
10
      } else {
11
        ans.push(slice2[0]);
12
        slice2 = &slice2[1..];
13
      }
14
    }
15
    ans.extend(slice1);
16
    ans.extend(slice2);
17
    unsafe { String::from_utf8_unchecked(ans) }
18
  }
19
}