I’m peep"Visual Studio Code is a lightweight but powerful source code editor which runs on your desktop and is available for Windows, macOS and Linux"
Documentation for Visual Studio Code
Find out how to set-up and get the most from Visual Studio Code. Optimized for building and debugging modern web and cloud applications. Visual Studio Code is free and available on your favorite platform - Linux, macOS, and Windows.code.visualstudio.com
C# programming with Visual Studio Code
Find out how to get the best out of Visual Studio Code and C#.
*not sure who I ended up all the way back there
use std::collections::HashMap ;
struct PrefixTable_t {
table: HashMap<String, u32>,
max: u32,
}
impl PrefixTable_t {
fn new() -> Self {
PrefixTable_t {
table: HashMap::new(),
max: 0
}
}
fn add_to_table( &mut self, word:&str ) {
let mut ret = String::new() ;
for itr in word.chars() {
ret.push( itr ) ;
self.table
.entry( ret.clone() )
.and_modify( |x| *x += 1 )
.or_insert(1) ;
}
self.max = match self.table.iter().max_by_key( |x| x.1 ) {
Some(x) => x.1.to_owned(),
None => 1,
}
}
fn is_empty( &self ) -> bool {
self.table.is_empty()
}
fn all_ones( &self ) -> bool {
self.table.iter().all( |x| *x.1 == 1 )
}
fn get_max_count( &self ) -> u32 {
self.max
}
fn longest_common_prefix( &self ) -> String {
if self.all_ones() {
return "".to_string() ;
}
let lcp = self.table
.iter()
.filter( |x| *x.1 == self.max )
.map( |x| x.0 )
.collect::<Vec<_>>() ;
lcp.iter()
.max_by_key( |x| x.len() )
.unwrap()
.to_string()
}
}
impl Solution {
pub fn longest_common_prefix(strs: Vec<String>) -> String {
match strs.len() {
0 => "".to_string(),
1 => strs[0].to_string(),
_ => {
if strs.iter().all( |x| x.is_empty() ) {
return "".to_string() ;
}
let mut p = PrefixTable_t::new() ;
strs
.iter()
.for_each( |s| p.add_to_table(s) ) ;
let lcp = p.longest_common_prefix() ;
match strs.iter().all( |x| x.starts_with( &lcp ) ) {
true => lcp,
false => "".to_string(),
}
}
}
}
}
That's a LOT of lines
That's a LOT of lines
I dont know how to read rust code but isn't the simplest way to just iterate over all strings at the same time and test for equality of characters from the strings and stop on the first failure, while saving the character for each pass of the equality test. I think the complexity would be the length of the longest string.
I would have to sit down and think about a more efficient solution.
