Commit4c9a3a9

committed

Added 4 solutions

1 parentfb4ed36 commit4c9a3a9Copy full SHA for 4c9a3a9

File tree

+150

-0

lines changed

+150

-0

lines changed

Lines changed: 37 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,37 @@`
	`1`	`+classSolution {`
	`2`	`+List<Integer>daysInMonth =Arrays.asList(31,28,31,30,31,30,31,31,30,31,30,31);`
	`3`	`+publicintdayOfYear(Stringdate) {`
	`4`	`+intyear =Integer.parseInt(date.split("-")[0]);`
	`5`	`+intmonth =Integer.parseInt(date.split("-")[1]);`
	`6`	`+intday =Integer.parseInt(date.split("-")[2]);`
	`7`	`+`
	`8`	`+intnumOfDays =getNumOfDays(month,isLeapYear(year));`
	`9`	`+`
	`10`	`+returnnumOfDays +day;`
	`11`	`+ }`
	`12`	`+`
	`13`	`+privatebooleanisLeapYear(intyear) {`
	`14`	`+if (year %4 ==0) {`
	`15`	`+if (year %100 ==0) {`
	`16`	`+returnyear %400 ==0;`
	`17`	`+ }`
	`18`	`+else {`
	`19`	`+returntrue;`
	`20`	`+ }`
	`21`	`+ }`
	`22`	`+returnfalse;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+privateintgetNumOfDays(intmonth,booleanisLeapYear) {`
	`26`	`+intnumOfDays =0;`
	`27`	`+for (inti =1;i <month;i++) {`
	`28`	`+if (i ==2) {`
	`29`	`+numOfDays +=isLeapYear ?daysInMonth.get(i -1) +1 :daysInMonth.get(i -1);`
	`30`	`+ }`
	`31`	`+else {`
	`32`	`+numOfDays +=daysInMonth.get(i -1);`
	`33`	`+ }`
	`34`	`+ }`
	`35`	`+returnnumOfDays;`
	`36`	`+ }`
	`37`	`+}`

Lines changed: 33 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,33 @@`
	`1`	`+classSolution {`
	`2`	`+publicintcountCharacters(String[]words,Stringchars) {`
	`3`	`+intgoodWordsLength =0;`
	`4`	`+Map<Character,Integer>charsMap =getMap(chars);`
	`5`	`+`
	`6`	`+for (Stringword :words) {`
	`7`	`+Map<Character,Integer>wordMap =getMap(word);`
	`8`	`+booleanallFound =true;`
	`9`	`+for (Charactercharacter :wordMap.keySet()) {`
	`10`	`+if (charsMap.getOrDefault(character,0) <wordMap.get(character)) {`
	`11`	`+allFound =false;`
	`12`	`+break;`
	`13`	`+ }`
	`14`	`+ }`
	`15`	`+`
	`16`	`+if (allFound) {`
	`17`	`+goodWordsLength +=word.length();`
	`18`	`+ }`
	`19`	`+ }`
	`20`	`+`
	`21`	`+`
	`22`	`+returngoodWordsLength;`
	`23`	`+ }`
	`24`	`+`
	`25`	`+privateMap<Character,Integer>getMap(Strings) {`
	`26`	`+Map<Character,Integer>map =newHashMap<>();`
	`27`	`+for (charc :s.toCharArray()) {`
	`28`	`+map.put(c,map.getOrDefault(c,0) +1);`
	`29`	`+ }`
	`30`	`+`
	`31`	`+returnmap;`
	`32`	`+ }`
	`33`	`+}`

Lines changed: 36 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,36 @@`
	`1`	`+classSolution {`
	`2`	`+publicintmaxDistance(int[][]grid) {`
	`3`	`+if (grid.length ==0 \|\|grid[0].length ==0) {`
	`4`	`+return -1;`
	`5`	`+ }`
	`6`	`+int[][]dirs = {{1,0}, {0,1}, {-1,0}, {0, -1}};`
	`7`	`+boolean[][]visited =newboolean[grid.length][grid[0].length];`
	`8`	`+Queue<int[]>queue =newLinkedList<>();`
	`9`	`+for (inti =0;i <grid.length;i++) {`
	`10`	`+for (intj =0;j <grid[0].length;j++) {`
	`11`	`+if (grid[i][j] ==1) {`
	`12`	`+queue.add(newint[]{i,j});`
	`13`	`+visited[i][j] =true;`
	`14`	`+ }`
	`15`	`+ }`
	`16`	`+ }`
	`17`	`+intmaxDist = -1;`
	`18`	`+while (!queue.isEmpty()) {`
	`19`	`+intsize =queue.size();`
	`20`	`+while (size-- >0) {`
	`21`	`+int[]curr =queue.remove();`
	`22`	`+for (int[]dir :dirs) {`
	`23`	`+intx =curr[0] +dir[0];`
	`24`	`+inty =curr[1] +dir[1];`
	`25`	`+if (x >=0 &&x <grid.length &&y >=0 &&y <grid[0].length && !visited[x][y] &&grid[x][y] ==0) {`
	`26`	`+visited[x][y] =true;`
	`27`	`+queue.add(newint[]{x,y});`
	`28`	`+ }`
	`29`	`+ }`
	`30`	`+ }`
	`31`	`+maxDist++;`
	`32`	`+ }`
	`33`	`+`
	`34`	`+returnmaxDist ==0 ? -1 :maxDist;`
	`35`	`+ }`
	`36`	`+}`

Lines changed: 44 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,44 @@`
	`1`	`+/**`
	`2`	`+ * Definition for a binary tree node.`
	`3`	`+ * public class TreeNode {`
	`4`	`+ * int val;`
	`5`	`+ * TreeNode left;`
	`6`	`+ * TreeNode right;`
	`7`	`+ * TreeNode(int x) { val = x; }`
	`8`	`+ * }`
	`9`	`+ */`
	`10`	`+classSolution {`
	`11`	`+publicintmaxLevelSum(TreeNoderoot) {`
	`12`	`+if (root ==null) {`
	`13`	`+return0;`
	`14`	`+ }`
	`15`	`+`
	`16`	`+Queue<TreeNode>queue =newLinkedList<>();`
	`17`	`+queue.add(root);`
	`18`	`+intmaxSum =0;`
	`19`	`+intmaxLevel =1;`
	`20`	`+intcurrLevel =1;`
	`21`	`+`
	`22`	`+while (!queue.isEmpty()) {`
	`23`	`+intsize =queue.size();`
	`24`	`+inttempSum =0;`
	`25`	`+while (size-- >0) {`
	`26`	`+TreeNoderemoved =queue.remove();`
	`27`	`+tempSum +=removed.val;`
	`28`	`+if (removed.left !=null) {`
	`29`	`+queue.add(removed.left);`
	`30`	`+ }`
	`31`	`+if (removed.right !=null) {`
	`32`	`+queue.add(removed.right);`
	`33`	`+ }`
	`34`	`+ }`
	`35`	`+if (maxSum <tempSum) {`
	`36`	`+maxSum =tempSum;`
	`37`	`+maxLevel =currLevel;`
	`38`	`+ }`
	`39`	`+currLevel++;`
	`40`	`+ }`
	`41`	`+`
	`42`	`+returnmaxLevel;`
	`43`	`+ }`
	`44`	`+}`

Comments

(0)