Commitbeebc13

authored

Improved tasks 2678, 2679, 2706, 2703, 2711

1 parentb900a04 commitbeebc13Copy full SHA for beebc13

File tree

+10

-20

lines changed

+10

-20

lines changed

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,16 +1,16 @@`
`1`	`1`	`packageg2601_2700.s2678_number_of_senior_citizens;`
`2`	`2`
`3`		`-// #Easy #Array #String #2023_09_11_Time_0_ms_(100.00%)_Space_40.7_MB_(97.65%)`
	`3`	`+// #Easy #Array #String #2025_02_26_Time_0_ms_(100.00%)_Space_42.10_MB_(95.99%)`
`4`	`4`
`5`	`5`	`publicclassSolution {`
`6`	`6`	`publicintcountSeniors(String[]details) {`
`7`		`-intcount =0;`
	`7`	`+intseniorCitizen =0;`
`8`	`8`	`for (Stringdetail :details) {`
`9`		`-if (((detail.charAt(11) -'0' ==6) && (detail.charAt(12) -'0' >0))`
`10`		`- \|\| (detail.charAt(11) -'0' >6)) {`
`11`		`-count++;`
	`9`	`+intage = (detail.charAt(11) -'0') *10 +detail.charAt(12) -'0';`
	`10`	`+if (age >60) {`
	`11`	`+seniorCitizen++;`
`12`	`12`	`}`
`13`	`13`	`}`
`14`		`-returncount;`
	`14`	`+returnseniorCitizen;`
`15`	`15`	`}`
`16`	`16`	`}`

Lines changed: 0 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -8,20 +8,17 @@`
`8`	`8`	`publicclassSolution {`
`9`	`9`	`publicintmatrixSum(int[][]nums) {`
`10`	`10`	`intresult =0;`
`11`		`-`
`12`	`11`	`for (int[]row :nums) {`
`13`	`12`	`Arrays.sort(row);`
`14`	`13`	`reverseArray(row);`
`15`	`14`	`}`
`16`		`-`
`17`	`15`	`for (inti =0;i <nums[0].length;i++) {`
`18`	`16`	`intmax =0;`
`19`	`17`	`for (int[]num :nums) {`
`20`	`18`	`max =Math.max(max,num[i]);`
`21`	`19`	`}`
`22`	`20`	`result +=max;`
`23`	`21`	`}`
`24`		`-`
`25`	`22`	`returnresult;`
`26`	`23`	`}`
`27`	`24`

Lines changed: 4 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,8 @@`
`1`		`-// #Easy #2023_09_14_Time_49_ms_(86.01%)_Space_42.9_MB_(39.39%)`
	`1`	`+// #Easy #2025_02_26_Time_50_ms_(82.03%)_Space_54.95_MB_(7.19%)`
`2`	`2`
`3`		`-functionargumentsLength(...args:any[]):number{`
	`3`	`+typeJSONValue=null\|boolean\|number\|string\|JSONValue[]\|{[key:string]:JSONValue};`
	`4`	`+`
	`5`	`+functionargumentsLength(...args:JSONValue[]):number{`
`4`	`6`	`returnargs.length`
`5`	`7`	`}`
`6`	`8`

Lines changed: 0 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,7 +6,6 @@ public class Solution {`
`6`	`6`	`publicintbuyChoco(int[]prices,intmoney) {`
`7`	`7`	`intminPrice1 =Integer.MAX_VALUE;`
`8`	`8`	`intminPrice2 =Integer.MAX_VALUE;`
`9`		`-`
`10`	`9`	`for (intprice :prices) {`
`11`	`10`	`if (price <minPrice1) {`
`12`	`11`	`minPrice2 =minPrice1;`
`@@ -15,9 +14,7 @@ public int buyChoco(int[] prices, int money) {`
`15`	`14`	`minPrice2 =price;`
`16`	`15`	`}`
`17`	`16`	`}`
`18`		`-`
`19`	`17`	`inttotalPrice =minPrice1 +minPrice2;`
`20`		`-`
`21`	`18`	`if (totalPrice >money) {`
`22`	`19`	`returnmoney;`
`23`	`20`	`}else {`

Lines changed: 0 additions & 6 deletions

Original file line number	Diff line number	Diff line change
`@@ -11,7 +11,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) {`
`11`	`11`	`intn =grid[0].length;`
`12`	`12`	`int[][]arrTopLeft =newint[m][n];`
`13`	`13`	`int[][]arrBotRight =newint[m][n];`
`14`		`-`
`15`	`14`	`for (inti =m -1;i >=0;i--) {`
`16`	`15`	`intc =0;`
`17`	`16`	`intr =i;`
`@@ -21,7 +20,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) {`
`21`	`20`	`set.add(grid[r++][c++]);`
`22`	`21`	`}`
`23`	`22`	`}`
`24`		`-`
`25`	`23`	`for (inti =1;i <n;i++) {`
`26`	`24`	`intr =0;`
`27`	`25`	`intc =i;`
`@@ -31,7 +29,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) {`
`31`	`29`	`set.add(grid[r++][c++]);`
`32`	`30`	`}`
`33`	`31`	`}`
`34`		`-`
`35`	`32`	`for (inti =0;i <n;i++) {`
`36`	`33`	`intr =m -1;`
`37`	`34`	`intc =i;`
`@@ -41,7 +38,6 @@ public int[][] differenceOfDistinctValues(int[][] grid) {`
`41`	`38`	`set.add(grid[r--][c--]);`
`42`	`39`	`}`
`43`	`40`	`}`
`44`		`-`
`45`	`41`	`for (inti =m -1;i >=0;i--) {`
`46`	`42`	`intc =n -1;`
`47`	`43`	`intr =i;`
`@@ -51,14 +47,12 @@ public int[][] differenceOfDistinctValues(int[][] grid) {`
`51`	`47`	`set.add(grid[r--][c--]);`
`52`	`48`	`}`
`53`	`49`	`}`
`54`		`-`
`55`	`50`	`int[][]result =newint[m][n];`
`56`	`51`	`for (intr =0;r <m;r++) {`
`57`	`52`	`for (intc =0;c <n;c++) {`
`58`	`53`	`result[r][c] =Math.abs(arrTopLeft[r][c] -arrBotRight[r][c]);`
`59`	`54`	`}`
`60`	`55`	`}`
`61`		`-`
`62`	`56`	`returnresult;`
`63`	`57`	`}`
`64`	`58`

Comments

(0)