My solution O(n)*O(queries.length) + O(n*n) !
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Code\n\nclass Solution {\npublic:\n    vector<vector<int>> rangeAddQueries(int n, v
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Code\n```\nclass Solution {\npublic:\n    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>>& queries) {\n        \n        vector<vector<int>> tmp(n,vector<int>(n,0)); \n        \n        for(auto x:queries){\n            for(int i=x[0];i<=x[2];i++) {\n                tmp[i][x[1]]+=1;\n                if(x[3]+1<n) tmp[i][x[3]+1]-=1;\n            }\n        }\n        \n        for(int i=0;i<n;i++){\n            for(int j=1;j<n;j++){\n                tmp[i][j] += tmp[i][j-1];\n            }\n        }\n        \n        return tmp;\n    }\n};\n```
['Array', 'Dynamic Programming', 'C++']