li_chx
/
rust_test
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Compare commits

base: li_chx:93d4b712d56b60bc618abfd983c94a68cf07c656
Branches Tags
li_chx:master
..
compare: li_chx:653e68c8f129d351c0ef182708d53fe241ba8813
Branches Tags
li_chx:master

No commits in common. "93d4b712d56b60bc618abfd983c94a68cf07c656" and "653e68c8f129d351c0ef182708d53fe241ba8813" have entirely different histories.
93d4b712d5 ... 653e68c8f1

1 changed files with 10 additions and 39 deletions
Show Stats Expand all files Collapse all files

47
src/main.rs
View File

@ -1,51 +1,22 @@
use std::collections::HashMap;
use std::collections::hash_map::Entry;
mod arr;
struct Solution {}
impl Solution {
fn get_rev(t: i32) -> i32 {
let mut t = t;
pub fn max_distance(nums1: Vec<i32>, nums2: Vec<i32>) -> i32 {
let mut ans = 0;
while t > 0 {
ans = ans * 10 + (t % 10);
t /= 10;
}
ans
}
pub fn min_mirror_pair_distance(nums: Vec<i32>) -> i32 {
let mut map = HashMap::<i32, Vec<usize>>::new();
for i in 0..nums.len() {
map.entry(nums[i]).or_insert_with(Vec::new).push(i);
}
let mut ans = 1e9 as usize;
for i in 0..nums.len() {
let x = nums[i];
match map.entry(Self::get_rev(x)) {
Entry::Occupied(arr) => {
//ans = ans.max(i.abs_diff(*arr.get().last().unwrap())).max(i.abs_diff(*arr.get().first().unwrap()));
let arr = arr.get();
if arr.len() == 1 {
if i != arr[0] && arr[0] > i {
ans = ans.min(arr[0] - i);
}
for i in 0..nums1.len() {
let mut idx = nums2.partition_point(|&x| x >= nums1[i]);
if idx == 0 {
continue;
}
let idx = arr.partition_point(|y| i >= *y);
if idx < arr.len() {
if i != arr[idx] {
ans = ans.min(arr[idx] - i);
idx -= 1;
ans = ans.max(idx as i32 - i as i32);
}
}
}
Entry::Vacant(_) => {}
}
}
if ans == 1e9 as usize { -1 } else { ans as i32 }
ans
}
}
fn main() {
println!("{:?}", Solution::min_mirror_pair_distance(vec![9,9]));
println!("{:?}", Solution::max_distance(vec![55,30,5,4,2],vec![100,20,10,10,5]));
}