Commit e9bf19c

committed

Changes for Leetcode problems

1 parent ce7a899 commit e9bf19cCopy full SHA for e9bf19c

File tree

+89

-0

lines changed

+89

-0

lines changed

Lines changed: 25 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,25 @@`
	`1`	`+// https://leetcode.com/problems/merge-intervals/`
	`2`	`+`
	`3`	`+class Solution {`
	`4`	`+ static bool compareInterval(vector<int> i1, vector<int> i2)`
	`5`	`+ {`
	`6`	`+ return (i1[0] < i2[0]);`
	`7`	`+ }`
	`8`	`+public:`
	`9`	`+ vector<vector<int>> merge(vector<vector<int>>& intervals) {`
	`10`	`+ vector<vector<int>> mergedIntervals;`
	`11`	`+ sort(intervals.begin(), intervals.end(), compareInterval);`
	`12`	`+ if(intervals.size() > 0){`
	`13`	`+ mergedIntervals.push_back(intervals[0]);`
	`14`	`+ for(int i = 1; i < intervals.size(); i++){`
	`15`	`+ if(mergedIntervals[mergedIntervals.size() - 1][1] < intervals[i][0]){`
	`16`	`+ mergedIntervals.push_back(intervals[i]);`
	`17`	`+ }`
	`18`	`+ else {`
	`19`	`+ mergedIntervals[mergedIntervals.size() - 1][1] = max(mergedIntervals[mergedIntervals.size() - 1][1], intervals[i][1]);`
	`20`	`+ }`
	`21`	`+ }`
	`22`	`+ }`
	`23`	`+ return mergedIntervals;`
	`24`	`+ }`
	`25`	`+};`

Lines changed: 2 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// https://leetcode.com/problems/rotate-image/`
	`2`	`+`
`1`	`3`	`class Solution {`
`2`	`4`	`public:`
`3`	`5`	`void rotate(vector<vector<int>>& matrix) {`

Lines changed: 44 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,44 @@`
	`1`	`+// https://leetcode.com/problems/set-matrix-zeroes/`
	`2`	`+`
	`3`	`+class Solution {`
	`4`	`+public:`
	`5`	`+ void setZeroes(vector<vector<int>>& matrix) {`
	`6`	`+ bool row0 = false, col0 = false;`
	`7`	`+ for(int i=0; i<matrix.size(); i++){`
	`8`	`+ if(matrix[i][0] == 0){`
	`9`	`+ row0 = true;`
	`10`	`+ }`
	`11`	`+ }`
	`12`	`+ for(int j=0; j<matrix[0].size(); j++){`
	`13`	`+ if(matrix[0][j] == 0){`
	`14`	`+ col0 = true;`
	`15`	`+ }`
	`16`	`+ }`
	`17`	`+ for(int i=0; i<matrix.size(); i++){`
	`18`	`+ for(int j=0; j<matrix[0].size(); j++){`
	`19`	`+ if(matrix[i][j] == 0){`
	`20`	`+ matrix[i][0] = 0;`
	`21`	`+ matrix[0][j] = 0;`
	`22`	`+ }`
	`23`	`+ }`
	`24`	`+ }`
	`25`	`+ for(int i=1; i<matrix.size(); i++){`
	`26`	`+ for(int j=1; j<matrix[0].size(); j++){`
	`27`	`+ if(matrix[i][0] == 0 \|\| matrix[0][j] == 0){`
	`28`	`+ matrix[i][j] = 0;`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+ }`
	`32`	`+ if(row0){`
	`33`	`+ for(int i=0; i<matrix.size(); i++){`
	`34`	`+ matrix[i][0] = 0;`
	`35`	`+ }`
	`36`	`+ }`
	`37`	`+ if(col0){`
	`38`	`+ for(int j=0; j<matrix[0].size(); j++){`
	`39`	`+ matrix[0][j] = 0;`
	`40`	`+ }`
	`41`	`+ }`
	`42`	`+`
	`43`	`+ }`
	`44`	`+};`

Lines changed: 18 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,18 @@`
	`1`	`+// https://leetcode.com/problems/unique-paths/`
	`2`	`+`
	`3`	`+class Solution {`
	`4`	`+public:`
	`5`	`+ int uniquePaths(int m, int n) {`
	`6`	`+ vector<vector<int>> dp = vector<vector<int>>(m, vector<int>(n, 0));`
	`7`	`+ for(int i=0; i<m; i++){`
	`8`	`+ for(int j=0; j<n; j++){`
	`9`	`+ if(i == 0 \|\| j == 0){`
	`10`	`+ dp[i][j] = 1;`
	`11`	`+ } else {`
	`12`	`+ dp[i][j] = dp[i-1][j] + dp[i][j-1];`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+ return dp[m-1][n-1];`
	`17`	`+ }`
	`18`	`+};`

Comments

(0)