id int64 1 3.58k | problem_description stringlengths 516 21.8k | instruction int64 0 3 | solution_c dict |
|---|---|---|---|
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int t[1001][2001];\n int n;\n int solve(int i, vector<vector<int>>& piles, int k, vector<vector<int>>&dp)\n {\n if(i >= n)\n return 0;\n if(dp[i][k] != -1)\n return dp[i][k];\n int nottaken = solve(i+1, piles, k, dp);\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution \n{\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) \n {\n vector<vector<int>> dp(piles.size(), vector<int>(2001, -1));\n return solve(piles, 0, k, dp);\n }\n int solve(vector<vector<int>>& piles, int pos, int k, vector<vector<int>>& dp)\n {\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int solve(vector<vector<int>>& piles, int k, int idx, vector<vector<int>>&dp){\n int n = piles.size();\n if(idx >= n){\n return 0;\n }\n if(dp[idx][k] != -1){\n return dp[idx][k];\n }\n int taken = 0;\n in... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n int n = piles.size();\n vector<vector<long long>> dp(n + 1, vector<long long>(k + 1, 0));\n\n // Initialize the DP table for the first pile\n for (int i = 0; i < min((int)piles[0].size(), k... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "#define ll long long\nconst ll INF = -1e9;\nclass Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n int n = int(piles.size());\n vector<vector<ll>> dp(n+1,vector<ll>(k+1,INF));\n dp[0][0] = 0;\n for(ll i=0;i<n;i++){\n for(ll j=0;j<=k;... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n long help(int i, int j,vector<vector<int>>& piles, vector<vector<int>>& prev,vector<vector<long>>& dp){\n int n=piles.size();\n if(i==n){\n if(j==0){\n return 0;\n }else{\n return INT_MIN;\n }\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int solve(int ind,int k,vector<vector<int>>& piles,vector<int>&coins, map<int,map<int,int>>&mp){\n if(ind==piles.size()||(k==0))return 0;\n if(k>coins[ind])return -1e9;\n if(mp[ind].count(k))return mp[ind][k];\n int ans = 0;\n int sum = 0 , ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "#include <bits/stdc++.h>\nclass Solution {\npublic:\n int solve(int i, vector<vector<int>>& piles, int k,\n vector<vector<int>>& dp) {\n if (i == piles.size()) {\n return 0;\n }\n if (k == 0) {\n return 0;\n }\n\n if (dp[i][k] != -1) ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n vector<vector<int>> dp;\n int func(vector<vector<int>>& piles,int n, int k,int idx){\n if(k==0 || idx==n){return 0;}\n if(dp[idx][k]!=-1){return dp[idx][k];}\n int ans=0,curr=0;\n ans=max(ans,func(piles,n,k,idx+1));\n int sizem=piles[idx]... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int help(vector<vector<int>>& piles, int idx,int k,vector<vector<int>>& cache){\n if(idx<0 or k<0)return 0;\n if(cache[idx][k]!=-1)return cache[idx][k]; \n int ans=help(piles,idx-1,k,cache);\n for(int i=0;i<piles[idx].size();i++){\n if((... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) {\n vector<vector<long long>> dp(piles.size(), vector<long long>(k, -1)),\n pfs(piles.size(), vector<long long>(k, 0));\n\n for (int i = 0; i < piles.size(); i++) {\n for (int j = 0; j ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic: // Complexity: O(m * k^2)\n int maxValueOfCoins(vector<vector<int>>& piles, int k) \n {\n int m = piles.size();\n\n vector<vector<long long>> sums(m+1, vector<long long>(k+1, 0));\n for (int i=1; i<=m; i++)\n {\n for (int j=1; j <= ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int maxValueOfCoins(vector<vector<int>>& piles, int k) \n {\n int m = piles.size();\n\n vector<vector<long long>> sums(m+1, vector<long long>(k+1, 0));\n for (int i=1; i<=m; i++)\n {\n for (int j=1; j <= min((int)piles[i-1].size(), k)... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int t[10001][2001];\n int swap(vector<vector<int>>& piles,int i,int k)\n {\n if(i>=piles.size()|| k==0)\n {\n return 0;\n }\n if(t[i][k]!=-1)\n {\n return t[i][k];\n }\n int nottake=swap(piles,i+1,k)... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\nvector<vector<int>>dp;\nint f(int i,int target,vector<vector<int>>& piles){\nif(i<0){\n return 0;\n\n}\nif(dp[i][target]!=-1){\n return dp[i][target];\n}\n\n int nottake=f(i-1,target,piles);\n int take=0;\n int sum=0;\n for(int j=0;j<piles[i].size();j++){\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int N;\n int dp[1001][2001];\n int solve(vector<vector<int>>& piles, int k, int startingIndex){\n if(startingIndex >= N){\n return 0;\n }\n\n // Memoization\n if(dp[startingIndex][k] != -1){\n return dp[startingIndex][k]... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int dp[1001][2005];\n int solve(int index, int n,vector<vector<int>>& piles,int k, int p){\n if(index>=n){\n if(p==k){\n return 0;\n }\n return INT_MIN;\n }\n if(dp[index][p]!=-1){\n ... |
1,393 | <p>There are <code>n</code> <strong>piles</strong> of coins on a table. Each pile consists of a <strong>positive number</strong> of coins of assorted denominations.</p>
<p>In one move, you can choose any coin on <strong>top</strong> of any pile, remove it, and add it to your wallet.</p>
<p>Given a list <code>piles</c... | 3 | {
"code": "class Solution {\npublic:\n int dp[1001][2005];\n int solve(int index, int n,vector<vector<int>>& piles,int k, int p){\n if(index>=n){\n if(p==k){\n return 0;\n }\n return INT_MIN;\n }\n if(dp[index][p]!=-1){\n ... |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 0 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int cnt=0;\n for(int i=0;i<=31;i++)\n {\n if( start&(1<<i) ^ (goal&(1<<i)))\n cnt++;\n }\n return cnt;\n }\n};",
"memory": "7400"
} |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 0 | {
"code": "class Solution {\npublic:\n // string convert2Binary(int number)\n // {\n // string res=\"\";\n // while(number>0)\n // {\n // if(number&1) res+='1';\n // else res+='0';\n // number>>1;\n // }\n // reverse(res.begin(),res.end());\n ... |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 0 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int ans = start ^ goal;\n int cnt = 0;\n while(ans > 1){\n cnt += (ans & 1);\n ans = ans >> 1;\n }\n\n if(ans == 1)\n cnt += 1;\n\n return cnt;\n }\n};",
"memory... |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 0 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int bitcount = 0;\n int mask = start^goal;\n\n if(mask == 0) return 0;\n\n while(mask != 0){\n bitcount += mask%2;\n mask >>= 1;\n }\n return bitcount;\n\n }\n};",
"m... |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 0 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int p=start^goal;\n return __builtin_popcount(p);\n }\n};",
"memory": "7600"
} |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 0 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int cnt = 0;\n while( start > 0 || goal > 0 ){\n if( (start & 1 ) != (goal & 1) ) cnt++;\n start >>=1;\n goal >>=1;\n }\n return cnt;\n }\n};",
"memory": "7600"
} |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 2 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int n=start^goal,c=0;\n while(n>0){\n c+=n&1;\n n>>=1;\n }\n return c;\n }\n};",
"memory": "7700"
} |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 2 | {
"code": "class Solution {\n public:\n int minBitFlips(unsigned start, unsigned goal) {\n return popcount(start ^ goal);\n }\n};",
"memory": "7700"
} |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 3 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) \n {\n int n=start^goal;\n int count=0;\n while(n!=0){if(n&1==1){count++;} n=n>>1;}\n return count; \n }\n};",
"memory": "7800"
} |
2,323 | <p>A <strong>bit flip</strong> of a number <code>x</code> is choosing a bit in the binary representation of <code>x</code> and <strong>flipping</strong> it from either <code>0</code> to <code>1</code> or <code>1</code> to <code>0</code>.</p>
<ul>
<li>For example, for <code>x = 7</code>, the binary representation is <... | 3 | {
"code": "class Solution {\npublic:\n int minBitFlips(int start, int goal) {\n int c=0;\n for(int i=0;i<31;i++)\n {\n int a=(1<<i)&start;\n int b=(1<<i)&goal;\n if(a!=b)\n c++;\n }\n return c;\n }\n};",
"memory": "7800"
} |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\n public:\n vector<int> findDiagonalOrder(vector<vector<int>>& g) {\n int m = g.size(), n = g[0].size();\n vector<int> res;\n res.reserve(m * n);\n auto in_bound = [&](int x, int y) {\n return 0 <= x && x < m && 0 <= y && y < n;\n };\n for (int sum = 0; sum < m * n;... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> diag_order;\n diag_order.reserve(mat.size() * mat.front().size());\n\n for (int n = 0; n < mat.size() + mat.front().size() - 1; ++n) {\n if (n % 2 == 0) {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\n public:\n vector<int> findDiagonalOrder(vector<vector<int>>& matrix) {\n const int m = matrix.size();\n const int n = matrix[0].size();\n vector<int> ans(m * n);\n int d = 1; // left-bottom -> right-top\n int row = 0;\n int col = 0;\n\n for (int i = 0; i < m * n; +... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if (mat.empty() || mat[0].empty()) return {};\n \n int m = mat.size();\n int n = mat[0].size();\n vector<int> result(m * n);\n int row = 0, col = 0;\n \n for (i... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size();\n\n int n = mat[0].size();\n\n vector<int> ans(m * n);\n\n int k = 0;\n\n int count = 0;\n\n \n\n int i = 0, j = 0;\n\n\n\n while (count <= m + n - 2) {\n\n if (... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if (mat.empty() || mat[0].empty()) return {};\n \n int m = mat.size();\n int n = mat[0].size();\n vector<int> result(m * n);\n int row = 0, col = 0;\n \n for (i... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int N = mat.size();\n int M = mat[0].size();\n vector<int> answer;\n\n int x = 0; \n int sum = 0; \n int dir = -1;\n\n auto addToAnswer = [&]() {\n int y = ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size();\n int n = mat[0].size();\n vector<int> res;\n for (int i = 0; i < m + n - 1; i++) {\n if (i % 2) {\n int x = i < n ? 0 : i - n + 1;\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int N = mat.size(); // Количество строк\n int M = mat[0].size(); // Количество колонок\n vector<int> result;\n\n int row = 0, column = 0; // Стартовые позиции\n bool direction_up = true; // Фла... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> res;\n size_t row = mat.size();\n size_t col = mat[0].size();\n int r, c;\n for(size_t d = 0; d < row + col - 1; d++){\n if(d%2){\n if(d < col)... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 0 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n = mat.size();\n int m = mat.front().size();\n int flip = 0;\n int dir[2][2] = {{-1, 1}, {1, -1}};\n vector<int> ans;\n for (int i = 0; i < n + m - 1; ++i) {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> traverse;\n int m=mat.size(), n=mat[0].size();\n for(int i=0; i<m+n-1; ++i){\n if(i%2) {\n for(int j=max(i-n+1, 0); j<m && i-j>=0; ++j) {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 1 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> nums;\n int row = 0;\n int col = 0;\n \n bool up = true;\n \n while (true) {\n nums.push_back(mat[row][col]);\n \n if (row ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size(), n = mat[0].size();\n int r = 0, c = 0, d = 1;\n vector<int> res;\n for (int i = 0; i < m*n; i++)\n {\n res.push_back(mat[r][c]);\n r -= d;\... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\nvector<int>ans;\n\nvoid f(vector<vector<int>>&v,int i,int j,int dir){\nif(i>=v.size()||j>=v[0].size()){\n return;\n}\nans.push_back(v[i][j]);\nif(dir==1){\nif(i-1>=0&&j+1<v[0].size()){\nf(v,i-1,j+1,dir);\n}\nelse{\nif(j+1<v[0].size()){ f(v,i,j+1,2); return ;}\nf(v,i+1,j,2);\n}... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\nprivate:\n vector<int> ans;\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if(mat.empty())\n {\n return ans;\n }\n int row = mat.size();\n int column = mat[0].size();\n int i = 0;\n int j = 0;\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\nvector<int>ans;\nvoid solve(vector<vector<int>>& mat,bool up,int i,int j){\n int n=mat.size();\n int m=mat[0].size();\n if(i==n-1 && j==m-1){\n ans.push_back(mat[i][j]);\n return;\n }\n\n ans.push_back(mat[i][j]);\n // cout<<n<<\" \"<<i<<\" \"<<m<<... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> res;\n if (mat.empty() || mat[0].empty()) {\n return res;\n }\n int m = mat.size();\n int n = mat[0].size();\n bool goingUp = true;\n int i = 0;... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int>ans;\n int m=mat.size();\n int n=mat[0].size();\n if(m==1 or n==1){\n for(auto x:mat){\n for(auto k:x)\n ans.push_back(k);\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n struct pos\n {\n int r;\n int c;\n };\n \n pos rotateRight(int r, int c)\n {\n // can we go right?\n if (c + 1 < n)\n {\n // yes\n return {r, c + 1};\n }\n return {r + 1, c};\n }\n\n p... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n = mat.size(), m = mat[0].size();\n\n int i = 0, j = 1;\n bool flag = true;\n vector<int>ans(n*m);\n int iter = 0;\n int tot = 0;\n while(tot < m + n - 1){\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n inline bool valid(int i, int j) {\n return i >= 0 && i < r && j >= 0 && j < c;\n } \n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n queue<pair<int, int>> q;\n r = mat.size();\n if (r == 0) {\n return {};\n }... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\nint ROWS;\nint COLS;\n bool isInMat(int r, int c) {\n return r >= 0 && r < ROWS && c >= 0 && c < COLS;\n }\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n\n std::vector<int> output;\n\n ROWS = mat.size();\n COLS = mat[0].size();\... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size();\n int n = mat[0].size();\n vector<int> result;\n result.reserve(m * n); // Pre-allocate space\n \n for (int sum = 0; sum < m + n - 1; sum++) {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int>ans;\n int n=mat.size();\n int m=mat[0].size();\n bool flag=true;\n for(int j=0;j<m;j++)\n {\n int i=0;\n int k=j;\n if(flag)\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n\n int rows = mat.size();\n int columns = mat[0].size();\n\n vector<vector<int>> visited_matrix(rows, vector<int>(columns, 0));\n\n vector<pair<int,int>> director = {{-1, +1}, {+1, -1} }; /... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n // 用款搜的手法强行level traverse\n // 其实每层reverse一下就行，但这里加工了一下，去掉了reverse的多余步骤。\n queue<pair<int, int>> q;\n int m = mat.size();\n int n = mat[0].size();\n vector<int> result(m * n,... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> vec;\n\n bool isValid(int x, int y, vector<vector<int>>& mat){\n return (x >= 0 && x < mat.size() && y >= 0 && y < mat[0].size());\n }\n void dfs(int x, int y, vector<vector<int>>& mat, bool dir){\n vec.push_back(mat[x][y]);\n if(isVa... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& g) {\n int m = g.size(), n = g[0].size();\n // (i + j) % 2 == 0 -> up, from less j\n // (i + j) % 2 == 1 -> down, from less i\n struct Node{\n int i;\n int j;\n Nod... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n \n vector <int> v;\n if(mat.size() == 1) // row = 0 [[1,2,3,4,5]]\n {\n for(int i =0; i<mat[0].size(); i++){\n \n v.push_back(mat[0][i]);\n }\n\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n \n vector <int> v;\n if(mat.size() == 1) // row = 0 [[1,2,3,4,5]]\n {\n for(int i =0; i<mat[0].size(); i++){\n \n v.push_back(mat[0][i]);\n }\n\n retu... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int>ans;\n int N = mat.size();\n int M = mat[0].size();\n if(N==0)return ans;\n for(int i=0;i<N+M-1;i++){\n int r = min(i,N-1);\n int c = i<N?0:i-(N-1);... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if(mat.size()==1){return mat[0];}\n vector<vector<int>> anh(mat.size()+mat[0].size()-1);\n vector<int> ans;\n for(int i=0;i<mat.size();i++){\n for(int j=0;j<mat[0].size();j++){\... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size(), n = mat[0].size();\n vector<int> ans;\n for (int a = 0; a < m + n - 1; a++) {\n int r = (a < n) ? 0 : a - n + 1;\n int c = (a < n) ? a : n - 1;\n\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> ret;\n int row = mat.size();\n if (row == 0) {\n return ret;\n }\n int col = mat[0].size();\n int x = 0;\n int y = 0;\n // upper half\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> ret;\n int row = mat.size();\n if (row == 0) {\n return ret;\n }\n int col = mat[0].size();\n int x = 0;\n int y = 0;\n // upper half\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n=mat.size(),m=mat[0].size();\n vector<int>ele[n+m];\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n ele[i+j].push_back(mat[i][j]);\n }\n }\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size(), n = mat[0].size();\n bool to_reverse = false;\n for (int i = 0; i < m; i++) {\n vector<int> line_result;\n int x = i, y = 0;\n get_line_result... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n using Pair = pair<int,int>;\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m = mat.size(), n = mat[0].size();\n vector<int> res;\n bool dir = true;\n vector<Pair> cur = {{0,0}};\n while(cur.size()) {\n vector... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int r = mat.size();\n int c = mat[0].size();\n vector<vector<int>>diags(r+c-1);\n for(int i=0;i<r;++i)\n {\n for(int j=0;j<c;++j)\n {\n diags[i+... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int r = mat.size();\n int c = mat[0].size();\n vector<vector<int>>diags(r+c-1);\n for(int i=0;i<r;++i)\n {\n for(int j=0;j<c;++j)\n {\n diags[i+... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int r = mat.size();\n int c = mat[0].size();\n vector<vector<int>>diags(r+c-1);\n for(int i=0;i<r;++i)\n {\n for(int j=0;j<c;++j)\n {\n diags[i+... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "bool init = []() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n return true;\n}();\n\nclass Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n std::vector<int> ret;\n if (mat.empty())\n return ret;\n\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> res;\n int m = mat.size(), n = mat[0].size();\n \n for (int k = 0; k < m+n-1; k++) {\n int i = k < m ? k : m-1;\n int j = k < m ? 0 : k-m+1;\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if (mat.empty()) return {};\n int m = mat.size();\n int n = mat[0].size();\n vector<int> res;\n int x = 0, y = 0;\n \n int dir = 0;\n while (y < n) {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if(mat.empty()) return {}; \n \n int n = mat.size();\n int m = mat[0].size();\n vector<int> ans;\n vector<vector<int>> diagonals(n+m-1);\n\n // Collect ele.s along eac... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m=mat.size(), n=mat[0].size();\n vector<vector<int> > diags(n+m-1);\n for(int i=0; i<m; ++i){\n for(int j=0; j<n; ++j){\n diags[i+j].push_back(mat[i][j]);\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int rows = mat.size();\n int cols = mat[0].size();\n vector<vector<int>> diagonals(rows+cols-1);\n for(int i = 0; i < rows; i++){\n for(int j = 0; j < cols; j++){\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n bool movement = true;\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<int> result;\n if (mat.size() == 0)\n return result;\n int m = mat.size();\n int n = mat[0].size();\n\n int x = 0; int y =0;\n re... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> ans;\n\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n = mat.size();\n int m = mat[0].size();\n vector<vector<int>> d(n+m-1);\n for (int i=0; i<n; i++) {\n for (int j=0; j<m; j++) {\n d[i... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<pair<int,int>>mov={{-1,1},{1,-1}};\n bool isvalid(int i,int j,int n,int m){\n return i<n and j<m and i>=0 and j>=0;\n }\n void dfs(int i,int j,int n,int m,vector<vector<int>>& vis,vector<vector<int>>& a,vector<int>&ans){\n ans.push_back(a[i][j]);... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n const int m = mat.size();\n const int n = mat[0].size();\n vector<int> res;\n res.reserve(m * n);\n\n vector<vector<int>> pos;\n for (int i = 0; i < m; i++) { pos.push_back({... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n = mat.size();\n int m = mat[0].size();\n int topDown = 0;\n vector<vector<int>> vis(n, vector<int>(m, 0));\n queue<pair<pair<int, int>, int>> q;\n q.push({{0, 0}, topDo... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m=mat.size();\n int n=mat[0].size();\n vector<vector<int>>arr(m+n-1);\n for(int i=0;i<m;i++)\n {\n for(int j=0;j<n;j++)\n {\n arr[i+j].push_... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nclass Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if (mat.empty()) return {}; // Handle empty matrix case\n\n int m = mat.size();\n int n = mat[0].size();\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n = mat.size() ;\n int m = mat[0].size() ;\n vector<int> a[n + m] ;\n for(int i = 0 ; i < n ; i++){\n for(int j = 0 ; j < m ; j++){\n if((i + j) % 2 == 0){\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int m=mat.size(), n=mat[0].size();\n queue<pair<int,int>> q;\n vector<int> final;\n final.push_back(mat[0][0]);\n vector<vector<int>> visited(m,vector<int>(n,0));\n q.push({0... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n void dfs(vector<vector<int>>& mat, vector<int>& sub, int rows, int cols, int r, int c) {\n if (r < 0 || c < 0 || r > rows || c > cols) {\n return;\n }\n\n sub.push_back(mat[r][c]);\n dfs(mat, sub, rows, cols, r-1, c+1);\n return;... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "#define PII pair<int, int>\nclass Solution {\n int dr[2] = {0, 1};\n int dc[2] = {1, 0};\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n queue<PII> q;\n q.push({0,0});\n int R = mat.size(), C = mat[0].size();\n vector<vector<int>> visited(R, vecto... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n std::vector<std::vector<int>> diagonals{{}};\n\n for (int i = 0; i < mat.size()-1; i++) {\n int x = i;\n int y = 0;\n while (x >= 0 && y < mat[0].size()) {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n vector<vector<int>> fin;\n int i,j;\n vector<int> tmp;\n fin.push_back(tmp);\n for(i=0;i<mat.size();i++)\n {\n for(j=0;j<mat[0].size();j++)\n {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\nprivate:\n int dx[2] = {-1, 1};\n int dy[2] = {1, -1};\n int direction = 0;\n vector<int> result;\n vector<vector<int>> mat;\n\n bool isValid(int x, int y) {\n return x >= 0 && x < mat.size() && \n y >= 0 && y < mat[x].size();\n }\n\n pair<int, in... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& nums) {\n unordered_map<int,vector<int>>map;\n int count = 1;\n for(int i=0;i<nums.size();i++)\n {\n int tcount = count;\n for(int j=0;j<nums[i].size();j++)\n {\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n = mat.size();\n int m = mat[0].size();\n vector<int> result;\n unordered_map<int, vector<int>> diagonalMap;\n\n for(int i=0; i<n; i++){\n for(int j=0; j<m; j++){\n ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n std::unordered_map<int, std::vector<int>> mp;\n int max = 0;\n int n = mat.size();\n for (int r = n - 1; ~r; --r)\n for (int c = 0; c < mat[r].size(); ++c) {\n mp... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n std::unordered_map<int, std::vector<int>> vec_map;\n int max_num = 0;\n for(int i = 0; i < mat.size(); i++) {\n for (int j = 0; j < mat[i].size(); j++) {\n vec_map[i+j]... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n unordered_map<int,vector<int>> umap;\n\n for(int i=0;i<mat.size();++i)\n {\n for(int j=0;j<mat[0].size();++j)\n {\n // cout << \"i+j \" << (i+j) << \" --- \" ... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n int n=mat.size(),m=mat[0].size();\n\n vector<int>ans(n*m);\n int i=0;\nmap<int,vector<int> >mp;\nfor(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n mp[i+j].push_back(mat[i][j]);\n }\n}\nbo... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n map<int,vector<int>>diags;\n int r = mat.size();\n int c = mat[0].size();\n for(int i=0;i<r;++i)\n {\n for(int j=0;j<c;++j)\n {\n diags[i+j].pus... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n map<int,vector<int>>diags;\n int r = mat.size();\n int c = mat[0].size();\n for(int i=0;i<r;++i)\n {\n for(int j=0;j<c;++j)\n {\n diags[i+j].pus... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n unordered_map<int,vector<pair<int,int>>> map;\n int n = mat.size(), m = mat[0].size();\n vector<int> res;\n\n for(int r=0;r<n;r++) {\n for(int c=0;c<m;c++) {\n ma... |
498 | <p>Given an <code>m x n</code> matrix <code>mat</code>, return <em>an array of all the elements of the array in a diagonal order</em>.</p>
<p> </p>
<p><strong class="example">Example 1:</strong></p>
<img alt="" src="https://assets.leetcode.com/uploads/2021/04/10/diag1-grid.jpg" style="width: 334px; height: 334px;... | 2 | {
"code": "class Solution {\npublic:\n vector<int> findDiagonalOrder(vector<vector<int>>& mat) {\n if(mat.empty() || mat[0].empty()) return {};\n map<int, vector<int>> m;\n int r = mat.size();\n int c = mat[0].size();\n\n for (int i = 0; i < r; ++i) {\n for (int j = 0;... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.