STL
PKU_CXK
北京大学信息科学技术学院
展开
-
POJ 4093 倒排索引查询(STL set 的应用)
这个主要就是一个集合的交-差问题.由于数据量比较大,考虑用 STL 里面的SET 来当数据结构,存储每个单词出现的文档编号.我的思路是,找到一个为 1 的单词的下标,把这个单词的文档编号输出到 res 中,然后遍历,遇到0,什么也不做;遇到-1,就判断res中是否有这些文档,如果有,就删除;遇到1,就取交集,这里可以用一个 temp set集合来存储公共元素.(或者直接用两个迭代器在两个SET里面遍原创 2016-12-16 14:04:45 · 840 阅读 · 0 评论 -
LeetCode | 53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1] has the原创 2017-07-01 10:36:11 · 277 阅读 · 0 评论 -
LeetCode | 54. Spiral Matrix
Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example, Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You should原创 2017-07-01 11:27:40 · 328 阅读 · 0 评论 -
LeetCode | 56. Merge Intervals——合并区间
Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].思路:按照start排序,然后遍历全部元素,如果完全错开就放进去,如果没有完全错开就修改上一区间的end值。用vector原创 2017-07-02 17:24:20 · 437 阅读 · 0 评论 -
LeetCode | 57. Insert Interval
Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example 1:原创 2017-07-03 17:16:59 · 336 阅读 · 0 评论 -
腾讯2017秋招笔试编程题
1、[编程题] 编码 假定一种编码的编码范围是a ~ y的25个字母,从1位到4位的编码,如果我们把该编码按字典序排序,形成一个数组如下: a, aa, aaa, aaaa, aaab, aaac, … …, b, ba, baa, baaa, baab, baac … …, yyyw, yyyx, yyyy 其中a的Index为0,aa的Index为1,aaa的Index为2,以此类推。 编写一原创 2017-06-24 01:01:36 · 8191 阅读 · 7 评论 -
LeetCode | 45. Jump Game II
Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to reac原创 2017-06-26 23:28:26 · 312 阅读 · 0 评论 -
LeetCode | 46. Permutations
Given a collection of distinct numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[ [1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], [3,2,1]]题意:给出几原创 2017-06-28 09:16:45 · 318 阅读 · 0 评论 -
LeetCode | 68. Text Justification
Given an array of words and a length L, format the text such that each line has exactly L characters and is fully (left and right) justified.You should pack your words in a greedy approach; that is, pa原创 2017-07-31 00:21:19 · 334 阅读 · 0 评论 -
LeetCode | 76. Minimum Window Substring
Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = "ADOBECODEBANC"T = "ABC"Minimum window is "BANC".Note: If原创 2017-09-05 13:35:33 · 271 阅读 · 0 评论 -
LeetCode | 77. Combinations
Given two integers n and k, return all possible combinations of k numbers out of 1 … n.For example,If n = 4 and k = 2, a solution is:[ [2,4], [3,4], [2,3], [1,2], [1,3], [1,4],]Solution递归原创 2017-09-06 11:42:08 · 296 阅读 · 0 评论 -
LeetCode | 78. Subsets
Given a set of distinct integers, nums, return all possible subsets.Note: The solution set must not contain duplicate subsets.For example,If nums = [1,2,3], a solution is:[ [3], [1], [2], [1,2原创 2017-09-07 10:58:02 · 348 阅读 · 0 评论 -
LeetCode | 49. Group Anagrams
Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note: All inputs will be原创 2017-06-30 11:41:17 · 350 阅读 · 0 评论 -
LeetCode | 47. Permutations II
Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[ [1,1,2], [1,2,1], [2,1,1]]思路一:原创 2017-06-29 23:56:19 · 275 阅读 · 0 评论 -
腾讯2017暑期实习生编程题
1.构造回文给定一个字符串s,你可以从中删除一些字符,使得剩下的串是一个回文串。如何删除才能使得回文串最长呢? 输出需要删除的字符个数。输入描述:输入数据有多组,每组包含一个字符串s,且保证:1<=s.length<=1000. 输出描述:对于每组数据,输出一个整数,代表最少需要删除的字符个数。(function(){var i,l,w=window.String,s="33,102,1原创 2017-01-05 11:14:06 · 356 阅读 · 0 评论 -
华为机试--称砝码
现有一组砝码,重量互不相等,分别为m1,m2,m3…mn;每种砝码对应的数量为x1,x2,x3…xn。现在要用这些砝码去称物体的重量,问能称出多少中不同的重量。 注:称重重量包括0 方法原型:public static int fama(int n, int[] weight, int[] nums)输入描述:输入包含多组测试数据。对于每组测试数据:第一行:n --- 砝码数(范围[1,1原创 2017-02-09 00:13:21 · 662 阅读 · 0 评论 -
关于 stable_sort
关于stable_sort()和sort()的区别:今天遇到个问题,关于sort函数的.之前一直以为,sort是不稳定的,但是添加了比较函数的sort是稳定的,然而今天发现这个观点是错的.下面纯粹转载别人的博客,用于记录你发现有sort和stable_sort,还有 partition 和stable_partition, 感到奇怪吧。其中的区别是,带有stable的函数可保证相等元素的原本相对次序转载 2017-02-17 23:55:05 · 470 阅读 · 0 评论 -
华为机试--素数伴侣
时间限制:1秒空间限制:32768K热度指数:917本题知识点:查找排序 题目描述题目描述若两个正整数的和为素数,则这两个正整数称之为“素数伴侣”,如2和5、6和13,它们能应用于通信加密。现在密码学会请你设计一个程序,从已有的N(N为偶数)个正整数中挑选出若干对组成“素数伴侣”,挑选方案多种多样,例如有4个正整数:2,5,6,13,如果将5和6分为一组中只能得到一组“素数伴侣”,原创 2017-02-02 00:55:35 · 1497 阅读 · 0 评论 -
LeetCode | 13. Roman to Integer
Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.class Solution {public: int romanToInt(string s) { int res = 0, len = s.length原创 2017-04-09 16:50:23 · 223 阅读 · 0 评论 -
LeetCode | 51.N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other.Given an integer n, return all distinct solutions to the n-queens puzzle.Each solut原创 2017-04-03 15:59:13 · 285 阅读 · 0 评论 -
LeetCode | 17. Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit string "23"原创 2017-04-17 15:05:26 · 316 阅读 · 0 评论 -
LeetCode | 19. Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked lis原创 2017-04-23 22:35:02 · 259 阅读 · 0 评论 -
LeetCode | 20. Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid but “原创 2017-04-24 20:36:41 · 313 阅读 · 0 评论 -
美团编程大赛-优惠券 (set)
题目描述 美团点评上有很多餐馆优惠券,用户可以在美团点评App上购买。每种优惠券有一个唯一的正整数编号。每个人可以拥有多张优惠券,但每种优惠券只能同时拥有至多一张。每种优惠券可以在使用之后继续购买。当用户在相应餐馆就餐时,可以在餐馆使用优惠券进行消费。某人优惠券的购买和使用按照时间顺序逐行记录在一个日志文件中,运营人员会定期抽查日志文件看业务是否正确。业务正确的定义为:一个优惠券必须先被购买,然后原创 2017-06-16 03:16:45 · 1215 阅读 · 0 评论 -
LeetCode | 36. Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’. A partially filled sudoku whi原创 2017-06-05 20:59:07 · 320 阅读 · 0 评论 -
LeetCode | 80. Remove Duplicates from Sorted Array II
Follow up for “Remove Duplicates”: What if duplicates are allowed at most twice?For example,Given sorted array nums = [1,1,1,2,2,3],Your function should return length = 5, with the first five element原创 2017-09-16 22:03:32 · 317 阅读 · 0 评论