Rust Concise Solution
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)$$ -->\nO(N * (N + Q))\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\nO(N * N)\n# Code\n```\nimpl Solution {\n    pub fn range_add_queries(n: i32, queries: Vec<Vec<i32>>) -> Vec<Vec<i32>> {\n        let n = n as usize;\n        let mut data = vec![vec![0; n + 1]; n];\n        \n        for q in queries {\n            let (x, y, u, v) = (q[0] as usize, q[1] as usize, q[2] as usize, q[3] as usize);\n            for i in x ..= u {\n                data[i][y] += 1;\n                data[i][v + 1] -= 1;\n            }\n        }\n        \n        let mut ret = vec![];\n        for i in 0 .. n {\n            let mut v = vec![];\n            let mut sum = 0;\n            for j in 0 .. n {\n                sum += data[i][j];\n                v.push(sum);\n            }\n            ret.push(v);\n        }\n        \n        ret\n    }\n}\n```
['Rust']