perf: optimize solutions to lc problem: No.2100 (#737)

YangFong · web-flow · commit 7a8da22df8ed · 2022-03-06T15:01:56.000+08:00
No.2100.Find Good Days to Rob the Bank
diff --git a/solution/2100-2199/2100.Find Good Days to Rob the Bank/README.md b/solution/2100-2199/2100.Find Good Days to Rob the Bank/README.md
@@ -122,7 +122,7 @@ class Solution {
             }
         }
         List<Integer> ans = new ArrayList<>();
-        for (int i = 0; i < n; ++i) {
+        for (int i = time; i < n - time; ++i) {
             if (time <= Math.min(left[i], right[i])) {
                 ans.add(i);
             }
@@ -149,7 +149,7 @@ public:
             if (security[i] <= security[i + 1])
                 right[i] = right[i + 1] + 1;
         vector<int> ans;
-        for (int i = 0; i < n; ++i)
+        for (int i = time; i < n - time; ++i)
             if (time <= min(left[i], right[i]))
                 ans.push_back(i);
         return ans;
@@ -178,7 +178,7 @@ func goodDaysToRobBank(security []int, time int) []int {
 		}
 	}
 	var ans []int
-	for i := 0; i < n; i++ {
+	for i := time; i < n - time; i++ {
 		if time <= left[i] && time <= right[i] {
 			ans = append(ans, i)
 		}
diff --git a/solution/2100-2199/2100.Find Good Days to Rob the Bank/README_EN.md b/solution/2100-2199/2100.Find Good Days to Rob the Bank/README_EN.md
@@ -110,7 +110,7 @@ class Solution {
             }
         }
         List<Integer> ans = new ArrayList<>();
-        for (int i = 0; i < n; ++i) {
+        for (int i = time; i < n - time; ++i) {
             if (time <= Math.min(left[i], right[i])) {
                 ans.add(i);
             }
@@ -137,7 +137,7 @@ public:
             if (security[i] <= security[i + 1])
                 right[i] = right[i + 1] + 1;
         vector<int> ans;
-        for (int i = 0; i < n; ++i)
+        for (int i = time; i < n - time; ++i)
             if (time <= min(left[i], right[i]))
                 ans.push_back(i);
         return ans;
@@ -166,7 +166,7 @@ func goodDaysToRobBank(security []int, time int) []int {
 		}
 	}
 	var ans []int
-	for i := 0; i < n; i++ {
+	for i := time; i < n - time; i++ {
 		if time <= left[i] && time <= right[i] {
 			ans = append(ans, i)
 		}
diff --git a/solution/2100-2199/2100.Find Good Days to Rob the Bank/Solution.cpp b/solution/2100-2199/2100.Find Good Days to Rob the Bank/Solution.cpp
@@ -12,7 +12,7 @@ class Solution {
             if (security[i] <= security[i + 1])
                 right[i] = right[i + 1] + 1;
         vector<int> ans;
-        for (int i = 0; i < n; ++i)
+        for (int i = tiem; i < n - time; ++i)
             if (time <= min(left[i], right[i]))
                 ans.push_back(i);
         return ans;
diff --git a/solution/2100-2199/2100.Find Good Days to Rob the Bank/Solution.go b/solution/2100-2199/2100.Find Good Days to Rob the Bank/Solution.go
@@ -16,7 +16,7 @@ func goodDaysToRobBank(security []int, time int) []int {
 		}
 	}
 	var ans []int
-	for i := 0; i < n; i++ {
+	for i := time; i < n - time; i++ {
 		if time <= left[i] && time <= right[i] {
 			ans = append(ans, i)
 		}
diff --git a/solution/2100-2199/2100.Find Good Days to Rob the Bank/Solution.java b/solution/2100-2199/2100.Find Good Days to Rob the Bank/Solution.java
@@ -17,7 +17,7 @@ public List<Integer> goodDaysToRobBank(int[] security, int time) {
             }
         }
         List<Integer> ans = new ArrayList<>();
-        for (int i = 0; i < n; ++i) {
+        for (int i = time; i < n - time; ++i) {
             if (time <= Math.min(left[i], right[i])) {
                 ans.add(i);
             }

Original file line number	Diff line number	Diff line change
`@@ -122,7 +122,7 @@ class Solution {`
`122`	`122`	`}`
`123`	`123`	`}`
`124`	`124`	`List<Integer> ans = new ArrayList<>();`
`125`		`- for (int i = 0; i < n; ++i) {`
	`125`	`+ for (int i = time; i < n - time; ++i) {`
`126`	`126`	`if (time <= Math.min(left[i], right[i])) {`
`127`	`127`	`ans.add(i);`
`128`	`128`	`}`
`@@ -149,7 +149,7 @@ public:`
`149`	`149`	`if (security[i] <= security[i + 1])`
`150`	`150`	`right[i] = right[i + 1] + 1;`
`151`	`151`	`vector<int> ans;`
`152`		`- for (int i = 0; i < n; ++i)`
	`152`	`+ for (int i = time; i < n - time; ++i)`
`153`	`153`	`if (time <= min(left[i], right[i]))`
`154`	`154`	`ans.push_back(i);`
`155`	`155`	`return ans;`
`@@ -178,7 +178,7 @@ func goodDaysToRobBank(security []int, time int) []int {`
`178`	`178`	`}`
`179`	`179`	`}`
`180`	`180`	`var ans []int`
`181`		`- for i := 0; i < n; i++ {`
	`181`	`+ for i := time; i < n - time; i++ {`
`182`	`182`	`if time <= left[i] && time <= right[i] {`
`183`	`183`	`ans = append(ans, i)`
`184`	`184`	`}`
Original file line number	Diff line number	Diff line change
`@@ -110,7 +110,7 @@ class Solution {`
`110`	`110`	`}`
`111`	`111`	`}`
`112`	`112`	`List<Integer> ans = new ArrayList<>();`
`113`		`- for (int i = 0; i < n; ++i) {`
	`113`	`+ for (int i = time; i < n - time; ++i) {`
`114`	`114`	`if (time <= Math.min(left[i], right[i])) {`
`115`	`115`	`ans.add(i);`
`116`	`116`	`}`
`@@ -137,7 +137,7 @@ public:`
`137`	`137`	`if (security[i] <= security[i + 1])`
`138`	`138`	`right[i] = right[i + 1] + 1;`
`139`	`139`	`vector<int> ans;`
`140`		`- for (int i = 0; i < n; ++i)`
	`140`	`+ for (int i = time; i < n - time; ++i)`
`141`	`141`	`if (time <= min(left[i], right[i]))`
`142`	`142`	`ans.push_back(i);`
`143`	`143`	`return ans;`
`@@ -166,7 +166,7 @@ func goodDaysToRobBank(security []int, time int) []int {`
`166`	`166`	`}`
`167`	`167`	`}`
`168`	`168`	`var ans []int`
`169`		`- for i := 0; i < n; i++ {`
	`169`	`+ for i := time; i < n - time; i++ {`
`170`	`170`	`if time <= left[i] && time <= right[i] {`
`171`	`171`	`ans = append(ans, i)`
`172`	`172`	`}`
Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ func goodDaysToRobBank(security []int, time int) []int {`
`16`	`16`	`}`
`17`	`17`	`}`
`18`	`18`	`var ans []int`
`19`		`- for i := 0; i < n; i++ {`
	`19`	`+ for i := time; i < n - time; i++ {`
`20`	`20`	`if time <= left[i] && time <= right[i] {`
`21`	`21`	`ans = append(ans, i)`
`22`	`22`	`}`
Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@ public List<Integer> goodDaysToRobBank(int[] security, int time) {`
`17`	`17`	`}`
`18`	`18`	`}`
`19`	`19`	`List<Integer> ans = new ArrayList<>();`
`20`		`- for (int i = 0; i < n; ++i) {`
	`20`	`+ for (int i = time; i < n - time; ++i) {`
`21`	`21`	`if (time <= Math.min(left[i], right[i])) {`
`22`	`22`	`ans.add(i);`
`23`	`23`	`}`