def get_icq_events(events): result = [] for item in events: if events[item]["module_name"] == "ICQ": result.append(events[item]) return result
def get_jabber_events(events): result = [] for item in events: if events[item]["module_name"] == "JABBER": result.append(events[item]) return result
def cart(requset): if requset.method == 'GET': # 获取数据 session_goods = requset.session.get('goods') result = [] for se_goods in session_goods: goods = Goods.objects.filter(pk=se_goods[0]).first() total_price = goods.shop_price * se_goods[1] data = [goods, se_goods[1], se_goods[2], total_price] result.append(data) return render(requset, 'cart.html', {'result': result})
def find_closest_elements(arr, K, X): index = binary_search(arr, X) low, high = index - K, index + K low = max(low, 0) high = min(high, len(arr) - 1) min_heap = [] for i in range(low, high + 1): heappush(min_heap, (abs(arr[i] - X), arr[i])) result = [] for _ in range(K): result.append(heappop(min_heap)[1]) result.sort() return result
def bst_sequences(root: TreeNode) -> List[List[int]]: result = [] if not root: result.append([]) return result prefix = [root.val] leftseqs = bst_sequences(root.left) rightseqs = bst_sequences(root.right) for leftseq in leftseqs: for rightseq in rightseqs: tempresults = [] interleave(leftseq, rightseq, tempresults, prefix) result.extend(tempresults) return result
def sortbyab(path): abpath = "F:/pdf/PDFab/" noabpath = "F:/pdf/PDFnoab/" pattern1 = re.compile(r'摘要|摘 要') pattern2 = re.compile(r'\n') for parent, dirnames, filenames in os.walk(path): for filename in filenames: result = [] file_path = os.path.join(parent, filename) print('文件名:%s' % filename) print('文件完整路径:%s\n' % file_path) with open(file_path, "rb") as fp: praser = PDFParser(fp) # 创建一个PDF文档 doc = PDFDocument() # 连接分析器 与文档对象 praser.set_document(doc) doc.set_parser(praser) # 提供初始化密码 # 如果没有密码 就创建一个空的字符串 doc.initialize() # 检测文档是否提供txt转换,不提供就忽略 if not doc.is_extractable: raise PDFTextExtractionNotAllowed # 创建PDf 资源管理器 来管理共享资源 rsrcmgr = PDFResourceManager() # 创建一个PDF设备对象 laparams = LAParams() device = PDFPageAggregator(rsrcmgr, laparams=laparams) # 创建一个PDF解释器对象 interpreter = PDFPageInterpreter(rsrcmgr, device) pdfStr = '' # 循环遍历列表,每次处理一个page的内容 for page in doc.get_pages(): # doc.get_pages() 获取page列表 interpreter.process_page(page) # 接受该页面的LTPage对象 layout = device.get_result() for x in layout: if hasattr(x, "get_text"): # print x.get_text() result.append(x.get_text()) result.replace('\n', '') print(result)
def couple(s, t): """Return a list of two-element lists in which the i-th element is [s[i], t[i]]. >>> a = [1, 2, 3] >>> b = [4, 5, 6] >>> couple(a, b) [[1, 4], [2, 5], [3, 6]] >>> c = ['c', 6] >>> d = ['s', '1'] >>> couple(c, d) [['c', 's'], [6, '1']] """ assert len(s) == len(t) "*** YOUR CODE HERE ***" result = [] length = len(s) for i in range(length): result.append([s[i], t[i]]) return result
def main(): # s = input() s = "aabbbccde" d = {} for c in s: if c not in d: d[c] = 1 else: d[c] = d[c] + 1 result = [] max = getMax(d) result.append(max) del d[max[0]] max = getMax(d) result.append(max) del d[max[0]] max = getMax(d) result.append(max) del d[max[0]] for r in result: print(r[0], r[1])
from unittest import result arr = [11, 3, 5, 9, 13] result = [] for i in range(1, max(arr), 2): if i not in arr: result.append(i) print(result)
def get_next_lost_chain(events): if not events: return None result = [] result_ids = {} main_key, main_value = events.popitem() result.append(main_value) result_ids[main_key] = 1 id = main_value["next_id"] while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = main_value["prev_id"] while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["prev_id"] else: break # try to restore for key in list(events.keys()): # already processed if key not in events.keys(): continue if events[key]["next_id"] in result_ids.keys(): id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["prev_id"] else: break elif events[key]["prev_id"] in result_ids.keys(): id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["prev_id"] else: break return result
def get_contact_events(contact, events): result = [] result_ids = {} id = contact["first_event_id"] while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = contact["first_unread_event_id"] while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = contact["last_event_id"] while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["prev_id"] else: break # try to restore for key in list(events.keys()): # already processed if key not in events.keys(): continue if events[key]["prev_id"] == contact["id"]: id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break elif events[key]["next_id"] in result_ids.keys(): id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["prev_id"] else: break elif events[key]["prev_id"] in result_ids.keys(): id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["next_id"] else: break id = key while True: if id in events.keys(): x = events[id] del events[id] result.append(x) result_ids[id] = 1 id = x["prev_id"] else: break return result
from unittest import result n = int(input()) result = [] for i in range(n): ps = input() sum = 0 for x in ps: if x == '(': sum += 1 else: sum -= 1 if sum < 0: sum = -99999 if sum == 0: result.append('YES') else: result.append('NO') for i in result: print(i)