Simple Bruteforce | Works on array, not on vector| C++
Intuition\nIf we do bruteforce on array, it gets accepted but if we do the same on vector, we get TLE.\n\n\n# Complexity\n- Time complexity: O(qn^2)\n\n- Space 
# Intuition\nIf we do bruteforce on array, it gets accepted but if we do the same on vector, we get TLE.\n\n\n# Complexity\n- Time complexity: O(qn^2)\n\n- Space complexity: O(n^2)\n\n# Code\n```\nclass Solution {\npublic:\n    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>>& queries) {\n        int v[n][n];\n        for(int i=0;i<n;++i){\n            for(int j=0;j<n;++j){\n                v[i][j]=0;\n            }\n        }\n        int m=queries.size();\n        for(int i=0;i<m;++i){\n            int ub=queries[i][0],lb=queries[i][1],lob=queries[i][2],rb=queries[i][3];\n            for(int j=ub;j<=lob;++j){\n                for(int k=lb;k<=rb;++k){\n                    v[j][k]+=1;\n                }\n            }\n        }\n        vector<vector<int>> ans(n,vector<int>(n,0));\n        for(int i=0;i<n;++i){\n            for(int j=0;j<n;++j){\n                ans[i][j]=v[i][j];\n            }\n        }\n        return ans;\n    }\n};\n```
['C++']