diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/longest_palindrome_concat.rs | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/longest_palindrome_concat.rs')
-rw-r--r-- | other/longest_palindrome_concat.rs | 39 |
1 files changed, 0 insertions, 39 deletions
diff --git a/other/longest_palindrome_concat.rs b/other/longest_palindrome_concat.rs deleted file mode 100644 index 2a97ed4..0000000 --- a/other/longest_palindrome_concat.rs +++ /dev/null @@ -1,39 +0,0 @@ -struct Solution; - -impl Solution { - pub fn longest_palindrome(words: Vec<String>) -> i32 { - let (mut hist, mut ans, a_code) = (vec![vec![0; 26];26], 0, 'a' as usize); - for w in words.iter() { - if let Some(i) = w.chars().nth(0) { - if let Some(j) = w.chars().nth(1) { - let i = i as usize - a_code; - let j = j as usize - a_code; - match hist[j][i] { - cnt if cnt > 0 => { - ans += 4; - hist[j][i] -= 1; - }, - _ => { - hist[i][j] += 1; - } - } - } - } - } - for i in 0..26 { - match hist[i][i] { - cnt if cnt > 0 => { - ans += 2; - break; - }, - _ => (), - } - } - ans - } -} - -fn main() { - let words = vec!["lc".to_string(), "cl".to_string(), "gg".to_string()]; - print!("{}", Solution::longest_palindrome(words)); -} |