LeetCode 641 Design Circular Deque

Problem Statement

use std::vec::Vec;

struct MyCircularDeque {
    v: Vec<i32>,
    head : usize,
    tail : usize,
    count : usize
}

/**
 * `&self` means the method takes an immutable reference.
 * If you need a mutable reference, change it to `&mut self` instead.
 */
impl MyCircularDeque {

    /** Initialize your data structure here. Set the size of the deque to be k. */
    fn new(k: i32) -> Self {
        let mut vec = Vec::with_capacity(k.clone() as usize);
        vec.resize(k.clone() as usize, 0);
        MyCircularDeque {
            v : vec,
            head : k as usize - 1, tail : 0, count : 0
        }
    }

    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    fn insert_front(&mut self, value: i32) -> bool {
        if self.is_full() {
            return false;
        }

        self.v[self.head.clone()] = value;
        self.head = (self.head + self.v.len() - 1) % self.v.len();
        self.count += 1;
        return true;
    }

    /** Adds an item at the rear of Deque. Return true if the operation is successful. */
    fn insert_last(&mut self, value: i32) -> bool {
        if self.is_full() {
            return false;
        }

        self.v[self.tail.clone()] = value;
        self.tail = (self.tail + 1) % self.v.len();
        self.count += 1;
        return true;
    }

    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    fn delete_front(&mut self) -> bool {
        if self.is_empty() {
            return false;
        }
        self.head = (self.head + 1) % self.v.len();
        self.count -= 1;
        return true;
    }

    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    fn delete_last(&mut self) -> bool {
        if self.is_empty() {
            return false;
        }
        self.tail = (self.tail + self.v.len() - 1) % self.v.len();
        self.count -= 1;
        return true;
    }

    /** Get the front item from the deque. */
    fn get_front(&self) -> i32 {
        if self.is_empty() {
            return - 1;
        }
        return self.v[(self.head.clone() + 1) % self.v.len()];
    }

    /** Get the last item from the deque. */
    fn get_rear(&self) -> i32 {
        if self.is_empty() {
            return -1;
        }
        return self.v[(self.tail - 1 + self.v.len()) % self.v.len()];
    }

    /** Checks whether the circular deque is empty or not. */
    fn is_empty(&self) -> bool {
        return self.count == 0;
    }

    /** Checks whether the circular deque is full or not. */
    fn is_full(&self) -> bool {
        return self.count == self.v.len();
    }
}