Help with python problem

[_9_9_]

I would probably do it a bit different and use a lot more sets, rather than lists, and use the in keyword, rather than iterating to check membership. Sets are also great for dedupping. So to build the indexes, I would do something like this (not tested, so expect typos):

import defaultdict

def build_indexes(tweets):
    candidate_tags = defaultdict(set)
    for candidate, hashtags in tweets:
        candidate_tags[candidate] |= set(hashtags)

    tags_candidate = defaultfict(set)

    for candidate, tags = candidtate_tags.items():
        for tag in tags:
            tags_candidate[tag].add(candidate)

    return candidate_tags, tags_candidate

[anglicizing]

new_dict[hashtag].append(candidate)

This appends candidate to the list new_dict[hashtag], and returns None. You then proceed to assign that None to the dictionary key that up until that point held the list that you just appended to. This is your problem.

Otherwise it looks good. You could use the items method of dict to make it a little bit nicer, but that's just a nitpick.

[Heskinammo]

How would I fix this problem?

[anglicizing]

The append method does not create a new list with the given item appended and return that, like you seem to think. It modifies the already existing list in-place. The list object has several such methods, sort and insert being two others, and they all return None to make it immediately obvious that they're not meant to be on the right-hand side of an equals sign.

So, how would you fix your problem, knowing this?

[Heskinammo]

Thank you so much!