Is there a shorter way to make this function?

后端 未结 7 911
鱼传尺愫
鱼传尺愫 2021-01-24 23:47

B. front_x Given a list of strings, return a list with the strings in sorted order, except group all the strings that begin with \'x\' first. e.g. [\'mix\', \'xyz\', \'apple\',

相关标签:
7条回答
  • 2021-01-24 23:59

    This works,and it's simple and easy to understand.

    def front_x(words):
        xlist = [item for item in words if item[0] =='x']
        nonXList = [item for item in words if item[0] !='x']
        xlist.sort() # The .sort() method sorts a list alphabetically 
        nonXList.sort()
        Combined_Lists = xlist + nonXList
        return Combined_Lists
        #You can also comment Combined_Lists and 
        #just have return xlist + nonXList
    

    Since you're new to Python,I tried to make it as simple as possible.

    0 讨论(0)
  • 2021-01-24 23:59
    >>> l = ['mix', 'xyz', 'apple', 'xanadu', 'aardvark'] 
    >>> sorted ([x for x in l if x.startswith('x')]) + sorted([x for x in l if not x.startswith('x')])
    ['xanadu', 'xyz', 'aardvark', 'apple', 'mix']
    
    0 讨论(0)
  • 2021-01-24 23:59
    return sorted([w for w in words if w[0] == 'x']) + sorted([w for w in words if w[0] != 'x'])
    
    0 讨论(0)
  • 2021-01-25 00:06

    The error for your return is because sort does not return a value, it merely modifies the list.

    This seems a fairly fast way to do this, it runs in linear time, you won't get much faster than that. That being said, you could do inline code to shorten it, but it's not always more readable that way.

    0 讨论(0)
  • 2021-01-25 00:14

    You could sort words with one call to sorted using the key parameter to "teach" sorted how you wish the items in words to be ordered:

    def front_x(words):
        return sorted(words, key=lambda word: (word[0] != 'x', word))
    

    The key function is called once for every item in words and returns a proxy value by which the items in words is to be sorted. tuples such as the one returned by the lambda function above, are sorted in lexicographic order (according to the first item in the tuple, and according to the second to break ties).

    This technique as well as others is explained in the excellent Sorting Howto.


    For example,

    print(front_x(['mix', 'xyz', 'apple', 'xanadu', 'aardvark']))
    # ['xanadu', 'xyz', 'aardvark', 'apple', 'mix']
    

    Note that if words contains an empty string, word[0] will raise an IndexError. In contrast ''.startswith('x') returns False. So use word.startswith('x') if you wish front_x to handle empty strings, and use word[0] == 'x' if you wish to raise an exception.

    0 讨论(0)
  • 2021-01-25 00:23

    The error is because .sort() is in-place. It returns None, and you can't do None + None

    Since Python's sort is stable, you can also accomplish this by doing two sorts

    >>> L = ['mix', 'xyz', 'apple', 'xanadu', 'aardvark']
    >>> sorted(sorted(L), key=lambda x:x[0]!='x')
    ['xanadu', 'xyz', 'aardvark', 'apple', 'mix']
    

    And the in-place version

    >>> L.sort()
    >>> L.sort(key=lambda x:x[0]!='x')
    >>> L
    ['xanadu', 'xyz', 'aardvark', 'apple', 'mix']
    
    0 讨论(0)
提交回复
热议问题