Skip to content

Commit 152997d

Browse files
committed
Fixed format
1 parent cc21c81 commit 152997d

File tree

1 file changed

+4
-2
lines changed
  • src/main/java/g3501_3600/s3501_maximize_active_section_with_trade_ii

1 file changed

+4
-2
lines changed

src/main/java/g3501_3600/s3501_maximize_active_section_with_trade_ii/Solution.java

+4-2
Original file line numberDiff line numberDiff line change
@@ -43,7 +43,8 @@ public List<Integer> maxActiveSectionsAfterTrade(String s, int[][] queries) {
4343
}
4444
List<Integer> result = new ArrayList<>();
4545
for (int[] query : queries) {
46-
int left = query[0], right = query[1];
46+
int left = query[0];
47+
int right = query[1];
4748
int leftIndex = binarySearch(segments, left) - 1;
4849
int rightIndex = binarySearch(segments, right) - 1;
4950
if (rightIndex - leftIndex + 1 <= 2) {
@@ -73,7 +74,8 @@ public List<Integer> maxActiveSectionsAfterTrade(String s, int[][] queries) {
7374
}
7475

7576
private int binarySearch(List<int[]> segments, int key) {
76-
int lo = 0, hi = segments.size();
77+
int lo = 0;
78+
int hi = segments.size();
7779
while (lo < hi) {
7880
int mid = lo + (hi - lo) / 2;
7981
if (segments.get(mid)[0] > key) {

0 commit comments

Comments
 (0)