Skip to content

Commit f5872dd

Browse files
author
“A1-4U2T1NN”
committed
fix: ran ./gradlew :maps_app:spotlessApply to correct formating;
1 parent 09fa451 commit f5872dd

File tree

1 file changed

+6
-7
lines changed
  • lesson_13/maps_java/maps_app/src/main/java/com/codedifferently/lesson13

1 file changed

+6
-7
lines changed

lesson_13/maps_java/maps_app/src/main/java/com/codedifferently/lesson13/Lesson13.java

Lines changed: 6 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -4,15 +4,14 @@ public class Lesson13 {
44

55
/**
66
* Provide the solution to LeetCode 3146 here:
7-
* https://leetcode.com/problems/permutation-difference-between-two-strings
8-
* You are given two strings s and t such that every character occurs at most once in s and t is a permutation of s.
9-
* The permutation difference between s and t is defined as
10-
* the sum of the absolute difference between the index of the occurrence
11-
* of each character in s and the index of the occurrence of the same character in t.
12-
* Return the permutation difference between s and t.
7+
* https://leetcode.com/problems/permutation-difference-between-two-strings You are given two
8+
* strings s and t such that every character occurs at most once in s and t is a permutation of s.
9+
* The permutation difference between s and t is defined as the sum of the absolute difference
10+
* between the index of the occurrence of each character in s and the index of the occurrence of
11+
* the same character in t. Return the permutation difference between s and t.
1312
*/
1413
public int findPermutationDifference(String s, String t) {
15-
14+
1615
int permuDifference = 0;
1716
// Created a counter to track Permutation Difference
1817
for (int i = 0; i < s.length(); i++) {

0 commit comments

Comments
 (0)