From 6060329fedaf836018012be26e2cb0279ce0c0ad Mon Sep 17 00:00:00 2001
From: Cool <747682928@qq.com>
Date: Sun, 25 Aug 2024 19:11:50 +0800
Subject: [PATCH] =?UTF-8?q?=E5=8E=9F=E6=9D=A5=E8=BF=99=E6=98=AF=E6=98=A8?=
 =?UTF-8?q?=E5=A4=A9=E7=9A=84=E6=AF=8F=E6=97=A5=E4=B8=80=E9=A2=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../LeetCode20240825.java                     | 21 +++++++++++++++++--
 1 file changed, 19 insertions(+), 2 deletions(-)

diff --git a/src/main/java/com/cool/one_question_per_day/LeetCode20240825.java b/src/main/java/com/cool/one_question_per_day/LeetCode20240825.java
index d5d15b7..5593511 100644
--- a/src/main/java/com/cool/one_question_per_day/LeetCode20240825.java
+++ b/src/main/java/com/cool/one_question_per_day/LeetCode20240825.java
@@ -1,5 +1,7 @@
 package com.cool.one_question_per_day;
 
+import org.junit.Test;
+
 /**
  * Created with IntelliJ IDEA.
  *
@@ -10,7 +12,22 @@ package com.cool.one_question_per_day;
 public class LeetCode20240825 {
 
     public int findPermutationDifference(String s, String t) {
-
+        int[] arr=new int[26];
+        char[] chars = s.toCharArray();
+        for (int i = 0; i < chars.length; i++) {
+            arr[chars[i]-97]=i;
+        }
+        int res=0;
+        char[] chars1 = t.toCharArray();
+        for (int i = 0; i < chars1.length; i++) {
+            int index = arr[chars1[i] - 97];
+            index=Math.abs(index-i);
+            res+=index;
+        }
+        return res;
+    }
+    @Test
+    public void test(){
+        findPermutationDifference("1","");
     }
-
 }