diff --git a/j2106_intro.rb b/j2106_intro.rb
index 4a35050..4898607 100755
--- a/j2106_intro.rb
+++ b/j2106_intro.rb
@@ -1,8 +1,8 @@
 #! usr/bin/env ruby
 # -*- coding: utf-8 -*-
 
-ziten = ["Apex","PDF","Minecraft","社長","委員長"]
-imi = ["ゲーム","あだ名","ゲーム","あだ名","学習委員長"]
+ziten = ["yah","gg"]
+imi = [" "," "]
 i = 1
 
 def loading(time)
@@ -28,8 +28,25 @@
 end
 
 def levenshtein_distance(x)
-  if x.length == 0
-    ziten.group_by(&:length).sort.first[1]
+  ziten = ["aweuiygf","aewf","waefgyu"]
+  if x.length == 0                            #1.もし入力した文字が空なら、
+    shortest = ziten.sort_by(&:length).first  #  配列zitenの要素の中で最も文字数が
+                                              #  少ないものを変数shortestに代入し
+    distance =+ shortest.length               #  その単語の長さを編集距離に足す。
+    p distance
+  else                                        #2.もし入力した文字数が1以上なら、
+    for divide in ziten
+      comparison_ziten = divide.split("")
+      comparison_input = x.split("")
+      for hikaku1 in comparison_ziten
+        if hikaku1 == comparison_input
+          p hikaku1
+        else
+          distance =+ 1
+        end
+      end
+    end
+    p distance
   end
 end    
     
diff --git a/renshu.rb b/renshu.rb
index 31e8349..c794dba 100755
--- a/renshu.rb
+++ b/renshu.rb
@@ -1,15 +1,6 @@
 #!usr/bin/env ruby
 # -*- coding: utf-8 -*-
 
-def search(target_num,input)
-  input.each_with_index do |num,index|
-    if num == target_num
-      puts "#{index +1}番目"
-      return
-    end
-  end
-  puts "ないよ"
-end
-
-input = [6,1,2,5,7,9,25,4]
-search(1,input)
+str = "123456"
+array = str.split("")
+p array