File tree Expand file tree Collapse file tree 2 files changed +7
-24
lines changed
maps_java/maps_app/src/main/java/com/codedifferently/lesson13 Expand file tree Collapse file tree 2 files changed +7
-24
lines changed Original file line number Diff line number Diff line change 44
55public class Lesson13 {
66 public int findPermutationDifference (String s , String t ) {
7- HashMap <Character , Integer > letters = new HashMap <>();
7+ HashMap <Character , Integer > hashMap = new HashMap <>();
88 int permDifferences = 0 ;
99 for (int i = 0 ; i < s .length (); i ++) {
10- letters .put (s .charAt (i ), i );
10+ hashMap .put (s .charAt (i ), i );
1111 }
12- for (char key : letters .keySet ()) {
12+ for (char key : hashMap .keySet ()) {
1313 int indexInT = t .indexOf (Character .toString (key ));
1414 permDifferences += Math .abs (s .indexOf (key ) - indexInT );
1515 }
16- // int sumDifference = 0;
17- // for (int i = 0; i < s.length(); i++) {
18- // char currentChar = s.charAt(i);
19- // int indexInT = t.indexOf(currentChar);
20- // int difference = Math.abs(i - indexInT);
21- // sumDifference += difference;
22-
2316 return permDifferences ;
2417 }
2518}
Original file line number Diff line number Diff line change 1- /**
2- * Provide the solution to LeetCode 3146 here:
3- * https://leetcode.com/problems/permutation-difference-between-two-strings
4- */
1+
52export function findPermutationDifference ( s : string , t : string ) : number {
6- const letters = new Map < string , number > ( ) ;
3+ const map = new Map < string , number > ( ) ;
74 for ( let i = 0 ; i < s . length ; i ++ ) {
8- letters . set ( s . charAt ( i ) , i ) ;
5+ map . set ( s . charAt ( i ) , i ) ;
96 }
107 let permDifferences = 0 ;
11- for ( const key of letters . keys ( ) ) {
8+ for ( const key of map . keys ( ) ) {
129 const indexInT = t . indexOf ( String ( key ) ) ;
1310 permDifferences += Math . abs ( s . indexOf ( key ) - indexInT ) ;
1411 }
15- // int sumDifference = 0;
16- // for (int i = 0; i < s.length(); i++) {
17- // char currentChar = s.charAt(i);
18- // int indexInT = t.indexOf(currentChar);
19- // int difference = Math.abs(i - indexInT);
20- // sumDifference += difference;
21-
2212 return permDifferences ;
2313 }
2414
You can’t perform that action at this time.
0 commit comments