1061. Lexicographically Smallest Equivalent String

class Solution(object):
    def smallestEquivalentString(self, s1, s2, baseStr):
        dict1={}
        dict2={}
        l=len(baseStr)
        l2=len(s1)
        list1=[]
        v=0
        for i in range(l2):
            if s1[i] in dict1 and s2[i] in dict1:
                a=dict1[s1[i]]
                b=dict1[s2[i]]
                v+=1
                for i in dict1:
                    if dict1[i]==a or dict1[i]==b:
                        dict1[i]=v


            elif s1[i] in dict1:
                v=dict1[s1[i]]
                dict1[s2[i]]=v
            elif s2[i] in dict1:
                v=dict1[s2[i]]
                dict1[s1[i]]=v
            else:
                list1.append(v)
                v+=1
                dict1[s1[i]]=v
                dict1[s2[i]]=v
        for i in dict1:
            if dict1[i] in dict2:
                dict2[dict1[i]].append(i)
            else:
                dict2[dict1[i]]=[i]
        for i in dict2:
            dict2[i]=sorted(dict2[i])
        ans=""
        for i in baseStr:
            if i in dict1:
                ans+=dict2[dict1[i]][0]
            else:
                ans+=i
        return ans