filter
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\n\nimpl Solution {\n  pub fn circular_game_losers(n: i32, k: i32) -> Vec<i32> {\n    // keep track of who\'s touched the ball\n    let mut whostouched: Vec<bool> = vec![false; n as usize];\n    let mut step = 1;\n    let mut cnt = 0;\n    whostouched[0] = true;\n\n    loop {\n      cnt+=k*step;\n      let player = (cnt%n) as usize;\n      if whostouched[player] {\n        break;\n      }\n      whostouched[player] = true;\n      step+=1;\n    }\n    (0..n).filter(|&i| !whostouched[i as usize]).map(|v| v+1 ).collect()\n  }\n}\n```
['Rust']