Update Minimum Distance

tanu312000 · web-flow · commit e60b5e93c1b7 · 2021-07-24T15:15:43.000+05:30
O(n)
diff --git a/Minimum Distance b/Minimum Distance
@@ -1,14 +1,25 @@
-def mindist(x,m,p):
-    n=len(x)
-    min_dis=-9999
+def mindist(x,m,p):                                              #Time Complexity - O(n2)
+    n=len(x)                                                          
+    min_dis=9999
     for i in range(n):
         for j in range(i+1,n):
             if m==x[i] and p==x[j] or \
                     m==x[j] and p==x[i] and abs(j - i) > min_dis:
                 min_dis = abs(j - i)
         return min_dis
+        
+ 
+ def min_distance(x,a,b):                                        #Time Complexity - O(n)
+    n=len(x)
+    last = -1
+    min_dis = 999
+    for i in range(n):
+        if x[i] == a or x[i] == b:
+            if last != -1:
+                min_dis=min(min_dis,i-last)
+            last=i                 #for updating 1st number's index
+    return min_dis
 
 x=[1,3,5,7,9,2,4,6,8]
-m=1
-p=4
-print(mindist(x,1,4))
+print(min_distance(x,5,8))
+
