Last active
April 18, 2017 03:43
-
-
Save squiidz/7235a89b508c7fb03d4dacc9d33c1b46 to your computer and use it in GitHub Desktop.
balanced symbols
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#[macro_use] | |
extern crate lazy_static; | |
use std::collections::HashMap; | |
lazy_static!( | |
static ref MAPPING: HashMap<char, char> = [('}', '{'), (')', '('), (']', '[')] | |
.iter() | |
.cloned() | |
.collect(); | |
); | |
fn main() { | |
let inputs = ["{(})[]({{)}}", "{]][)", "{{()}}", "{{}}([)]", "(()))))){}"]; | |
let result: Vec<_> = inputs | |
.iter() | |
.map(|inp| is_balanced(inp)) | |
.map(|res| if res { "YES" } else { "NO" }) | |
.collect(); | |
for (i, r) in result.iter().enumerate() { | |
println!("{} => {}", r, inputs[i]); | |
} | |
} | |
fn is_balanced(input: &str) -> bool { | |
let mut stack = Vec::new(); | |
for c in input.chars() { | |
match c { | |
'{' | '(' | '[' => stack.push(c), | |
'}' | ')' | ']' => { | |
if let Some(cr) = MAPPING.get(&c) { | |
if let Ok(idx) = find_elem(&stack, *cr) { | |
stack.remove(idx); | |
} else { | |
return false; | |
} | |
} | |
} | |
_ => continue, | |
} | |
} | |
stack.is_empty() | |
} | |
fn find_elem(vector: &[char], c: char) -> Result<usize, &str> { | |
for (idx, v) in vector.iter().enumerate() { | |
if *v == c { | |
return Ok(idx); | |
} | |
} | |
Err("Char not found !") | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment