Skip to content

Commit d3b4560

Browse files
solves check if one string swap can make strings equal
1 parent 522c2b1 commit d3b4560

File tree

2 files changed

+3
-2
lines changed

2 files changed

+3
-2
lines changed

README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -435,7 +435,7 @@
435435
| 1773 | [Count Items Matching a Rule](https://leetcode.com/problems/count-items-matching-a-rule) | [![Java](assets/java.png)](src/CountItemsMatchingARule.java) | |
436436
| 1779 | [Find Nearest Point That Has the Same X or Y Coordinate](https://leetcode.com/problems/find-nearest-point-that-has-the-same-x-or-y-coordinate) | [![Java](assets/java.png)](src/FindNearestPointThatHasTheSameXOrYCoordinate.java) | |
437437
| 1784 | [Check if Binary String Has at Most One Segment of Ones](https://leetcode.com/problems/check-if-binary-string-has-at-most-one-segment-of-ones) | [![Java](assets/java.png)](src/CheckIfBinaryStringHasAtMostOneSegmentOfOnes.java) | |
438-
| 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal) | | |
438+
| 1790 | [Check if One String Swap Can Make Strings Equal](https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal) | [![Java](assets/java.png)](src/CheckIfOneStringSwapCanMakeStringsEqual.java) | |
439439
| 1791 | [Find Center of Star Graph](https://leetcode.com/problems/find-center-of-star-graph) | | |
440440
| 1796 | [Second Largest Digit in a String](https://leetcode.com/problems/second-largest-digit-in-a-string) | | |
441441
| 1800 | [Maximum Ascending Subarray Sum](https://leetcode.com/problems/maximum-ascending-subarray-sum) | | |

src/CheckIfOneStringSwapCanMakeStringsEqual.java

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -14,6 +14,7 @@ public boolean areAlmostEqual(String s1, String s2) {
1414
}
1515

1616
private boolean areSameChars(String s1, String s2, Queue<Integer> differenceIndexes) {
17-
17+
final int i = differenceIndexes.poll() , j = differenceIndexes.poll();
18+
return s1.charAt(i) == s2.charAt(j) && s1.charAt(j) == s2.charAt(i);
1819
}
1920
}

0 commit comments

Comments
 (0)