Rustlings Hashmaps 3 Exercise [closed] - rust

Question

Closed. This question needs to be more focused. It is not currently accepting answers.
Want to improve this question? Update the question so it focuses on one problem only by editing this post.
Closed 3 days ago.
Improve this question
I have written a solution that works for Rustlings Hashmaps 3 but its horid(or maybe it isnt I dont know)
Whats the optimal solution for it?
Please explain simply, im an idiot
The Question:
A list of scores (one per line) of a soccer match is given. Each line
is of the form :
<team_1_name>,<team_2_name>,<team_1_goals>,<team_2_goals>
Example: England,France,4,2 (England scored 4 goals, France 2).
You have to build a scores table containing the name of the team, goals
the team scored, and goals the team conceded. One approach to build
the scores table is to use a Hashmap. The solution is partially
written to use a Hashmap, complete it to pass the test.
Make me pass the tests!
// I AM NOT DONE
use std::collections::HashMap;
// A structure to store team name and its goal details.
struct Team {
name: String,
goals_scored: u8,
goals_conceded: u8,
}
fn build_scores_table(results: String) -> HashMap<String, Team> {
// The name of the team is the key and its associated struct is the value.
let mut scores: HashMap<String, Team> = HashMap::new();
for r in results.lines() {
let v: Vec<&str> = r.split(',').collect();
let team_1_name = v[0].to_string();
let team_1_score: u8 = v[2].parse().unwrap();
let team_2_name = v[1].to_string();
let team_2_score: u8 = v[3].parse().unwrap();
//create both objects
let mut team1 = Team{
name:team_1_name,
goals_scored:team_1_score,
goals_conceded:team_2_score,
};
let mut team2 = Team{
name:team_2_name,
goals_scored:team_2_score,
goals_conceded:team_1_score,
};
//if it isnt in the hashmap add it
if !scores.contains_key(&team1.name){
scores.insert(team1.name.to_owned(),team1);
}
// if it is in the hashmap get it, add values, then insert it back in.
else{
let score = scores.get(&team1.name).unwrap();
team1.goals_scored = team1.goals_scored+ score.goals_scored;
team1.goals_conceded = team1.goals_conceded+ score.goals_conceded;
scores.insert(team1.name.to_owned(),team1);
}
if !scores.contains_key(&team2.name){
scores.insert(team2.name.to_owned(),team2);
}
else{
let score = scores.get(&team2.name).unwrap();
team2.goals_scored = team2.goals_scored+ score.goals_scored;
team2.goals_conceded = team2.goals_conceded+ score.goals_conceded;
scores.insert(team2.name.to_owned(),team2);
}
// TODO: Populate the scores table with details extracted from the
// current line. Keep in mind that goals scored by team_1
// will be the number of goals conceded from team_2, and similarly
// goals scored by team_2 will be the number of goals conceded by
// team_1.
}
scores
}
#[cfg(test)]
mod tests {
use super::*;
fn get_results() -> String {
let results = "".to_string()
+ "England,France,4,2\n"
+ "France,Italy,3,1\n"
+ "Poland,Spain,2,0\n"
+ "Germany,England,2,1\n";
results
}
#[test]
fn build_scores() {
let scores = build_scores_table(get_results());
let mut keys: Vec<&String> = scores.keys().collect();
keys.sort();
assert_eq!(
keys,
vec!["England", "France", "Germany", "Italy", "Poland", "Spain"]
);
}
#[test]
fn validate_team_score_1() {
let scores = build_scores_table(get_results());
let team = scores.get("England").unwrap();
assert_eq!(team.goals_scored, 5);
assert_eq!(team.goals_conceded, 4);
}
#[test]
fn validate_team_score_2() {
let scores = build_scores_table(get_results());
let team = scores.get("Spain").unwrap();
assert_eq!(team.goals_scored, 0);
assert_eq!(team.goals_conceded, 2);
}
}
Need the optimal solution for hashmaps exercise 3