René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"[Week 6] DICTIONARY self review - ChaeheeKang-GitHub","articleBody":"# DICTIONARY self review ![](https://img.shields.io/badge/-WA-%23e00000)\r\n\r\n## 1. 해결 시도 과정\r\n그래프를 만들어 어느 알파벳이 선행되어야 하는지 해결하고자 하였습니다.\r\n\r\n## 2. 작성한 코드와 설명\r\n``` py3\r\n\r\ndef makegraph(word,p):\r\n    for j in range(1,N):\r\n        i=j-1\r\n        l=min(len(word[i]),len(word[j]))\r\n        for k in range(l):\r\n            if word[i][k]==word[j][k]:\r\n                continue\r\n            a=ord(word[i][k])-ord('a')\r\n            b=ord(word[j][k])-ord('a')\r\n            p[a][b]=1\r\n            break\r\ndef dfs(x):\r\n    check[x]=True\r\n    for nx in range(26):\r\n        if p[x][nx]==1 and not check[nx]:\r\n            dfs(nx)\r\n    ans.append(x)\r\n\r\ndef makeResult():\r\n    ans.reverse()\r\n    for i in range(26):\r\n        for j in range(i+1,26):\r\n            if p[ans[j]][ans[i]]:\r\n                return False\r\n    return ans\r\n\r\nC=int(input())\r\nfor _ in range(C):\r\n    N=int(input())\r\n    word=[]\r\n    ans=[]\r\n    p=[[0]*27 for _ in range(27)]\r\n    check=[False]*27\r\n    for x in range(N):\r\n        word.append(input().rstrip())\r\n    makegraph(word,p)\r\n    \r\n    \r\n    for i in range(26):\r\n        if check[i]==False:\r\n            dfs(i)\r\n    if makeResult()==False:\r\n        print(\"INVALID HYPOTHESIS\")\r\n    else:\r\n        ans=list(map(lambda x : chr(ord('a')+x),ans))\r\n        ans.reverse()\r\n        print(''.join(ans))\r\n\r\n\r\n```\r\n\r\n\r\n## 3. 막힌 점 및 개선 사항\r\n출력이 의도대로 나오지 않습니다.. 다시 시도해봐야할 것 같습니다.","author":{"url":"https://github.com/chaeheekang","@type":"Person","name":"chaeheekang"},"datePublished":"2022-03-03T13:37:02.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/187/Advanced-Algorithm-Study/issues/187"}