Write a function that takes a single argument (a, # list of names) and returns a string representing the English-formatted # conjunction of those names. For example, given these names: ['Alice', 'Bob', 'Carlos', 'Diana']. The output would be: "Alice, Bob, Carlos and Diana"

def conjunctNames(names):
    line = ""
    length = len(names)
    for i in range(len(names)-1):
        if i == len(names)-2:
            line += names+' and'
        else:
            line += names+', '
    line += ' ' + names[length-1]
    print line.1

# Once the above is working, we iterate on the problem by adding a second # argument to our function.. This new argument is called `limit` and controls the maximum number of names # that should be displayed. Any remaining items are "summarized" using the. 1point3acres.com/bbs # string "# more" (e.g. "Alice, Bob and 2 more" when `limit=2`).

def conjunctNames(names,li)
    line = ""
    length = len(names)
    limit = li

    num = length - li
    if num <= 0:
        limit = length-1

    for i in range(limit):
        if i == limit-1:
            line += names+' and'
        else:
            line += names+', '. 
    if num > 0:
        line += ' ' + str(num)+' more'
    else:
        line += ' ' + names[length-1]
    print line

http://www.1point3acres.com/bbs/forum.php?mod=viewthread&tid=145763&extra=page%3D1%26filter%3Dsortid%26sortid%3D311%26searchoption[3046][value]%3D33%26searchoption[3046][type]%3Dradio%26sortid%3D311

# CODE READING（what's the purpose of this function） . 1point 3acres 璁哄潧 def getFieldToItemsDict(list_of_items, field_name): d = defaultdict(list) for item in list_of_items: d[getattr(item, field_name, None)].append(item) return d # find bug in this function, this is my corrected version, th bugs are some minor subscript bugs, note the edge cases def sb(sorted_list, needle): def sb_internal(low, high): if not sorted_list: return None.鏈枃鍘熷垱鑷�1point3acres璁哄潧 if low > high:.1point3acres缃� return None pivot_pos = (low + high) / 2 if pivot_pos >= len(sorted_list): return None elif pivot_pos < 0: return None 鏉ユ簮涓€浜�.涓夊垎鍦拌鍧�. pivot = sorted_list[pivot_pos] if needle == pivot: return pivot elif needle < pivot: return sb_internal(low, pivot_pos) else: return sb_internal(pivot_pos + 1, high) . return sb_internal(0, len(sorted_list) - 1) 2.二轮问了项目，preference,然后coding: code isBipartiteGraph, 注意robustness, graph can be not strongly connected.看代码习惯， 注意不让user有太多传进参数。这轮有点紧张，面得不好，跪了。