FilesExpand file tree

 master

/

in_array.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

31 lines (25 loc) · 898 Bytes

 master

/

in_array.py

Copy path

Top

File metadata and controls

• Code
• Blame

31 lines (25 loc) · 898 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

"""

Which are in?

Given two arrays of strings a1 and a2 return a sorted array r in lexicographical order of the strings of a1 which are substrings of strings of a2.

#Example 1: a1 = ["arp", "live", "strong"]

a2 = ["lively", "alive", "harp", "sharp", "armstrong"]

returns ["arp", "live", "strong"]

#Example 2: a1 = ["tarp", "mice", "bull"]

a2 = ["lively", "alive", "harp", "sharp", "armstrong"]

returns []

#Notes: Arrays are written in "general" notation. See "Your Test Cases" for examples in your language.

Beware: r must be without duplicates.

"""

def in_array(array1,array2):

li=[]

for x in array1:

for y in array2:

if (x in y) and (x not in li):

li.append(x)

# 排序 list.sort()

li.sort()

return li

a1 = ["live", "arp", "strong"]

a2 = ["lively", "alive", "harp", "sharp", "armstrong"]

r = ['arp', 'live', 'strong']

print(in_array(a1,a2))