Update 952._Largest_Component_Size_by_Common_Factor.md

Author: 0xkookoo

docs/Leetcode_Solutions/Python/952._Largest_Component_Size_by_Common_Factor.md

@@ -49,11 +49,11 @@ Note:
 
 
 Using the input of first example,We can firstly do Prime factor decomposition for each number in A, 
-then we can get the map:{2: [4, 6], 3: [6, 15], 5: [15, 35], 7: [35]}), 
+then we can get the ```map:{2: [4, 6], 3: [6, 15], 5: [15, 35], 7: [35]})```, 
 in which values are all multiples of the key(must be prime). 
 Then we can regard the first multiple as the root of all the multiples, 
-connect each multiple with the root. In this example, we connect 6 with 4(root), connect 15 with 6(root), 
-connect 35 with 15(root), because there is only one multiple in 7: [35], so no connection. 
+connect each multiple with the root. In this example, we ```connect 6 with 4(root)```, ```connect 15 with 6(root)```, 
+```connect 35 with 15(root)```, because there is only one multiple in ```7: [35]```, so no connection. 
 At the end, we can get the largest size 4, which is the result. The root of all the numbers in A is the number 4.