缺失的学妹 考察点 STL MAP Time Mem Len Lang 3.81s 39.1MB 0.68K G++ 题意分析 给出妹子学号的个数n,给出n个学号,和n-1个学号,求在n学号中那个没有在n-1个学号中出现. 采用MAP,第一次统计所有学号,使second为1,第二次使对用的second++,即为2,之后用迭代器遍历,发现如果有一个对应的second为1的话,输出那个学号,break即可. 代码总览 /* Title:AOJ.720 Author:pengwill Date:201
任务:有学生,科目,考分三张表,需要从中筛选出五门考分总和超过720的学生. 科目表最简单只有五条记录: CREATE TABLE tb_course ( id NUMBER not null primary key, name NVARCHAR2(10) not null ) Insert into tb_course(id,name) values('','语文'); Insert into tb_course(id,name) values('','数学'); Insert into tb
7-19 1:$(event.target).parents().filter("tr").find("host-name") 为什么选择不到别的host-name? 2:bootstrap模态框两个巨大问题的解决办法 ①如何为bootstrap上的控件绑定事件 $(document).on("blur",".ip-txt",function(){ var hehe = $(event.target).val(); var r
Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest l
Given a list of strings words representing an English Dictionary, find the longest word in words that can be built one character at a time by other words in words. If there is more than one possible answer, return the longest word with the smallest l