qq_34673038的博客

With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players from the best teams doing battles for the World Cup trophy in South Africa. Si...

1010 Radix (25point(s))Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal number and 110 is a binary number.Now for an...

1009 Product of Polynomials (25point(s))This time, you are supposed to find A×B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 li...

1008 Elevator (20point(s))The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in spec...

1007 Maximum Subsequence Sum (25point(s))Given a sequence of K integers { N​1​​ , N​2​​ , …, N​K​​ }. A continuous subsequence is defined to be { N​i​​ , N​i+1​​ , …, N​j​​ } where 1≤i≤j...

At the beginning of every day, the first person who signs in the computer room will unlock the door, and the last one who signs out will lock the door. Given the records of signing in’s and out’s, you...

1005 Spell It Right (20point(s))Given a non-negative integer N, your task is to compute the sum of all the digits of N, and output every digit of the sum in English.Input Specification:Each input f...

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.Input Specification:Each input file contains one test case. Each case starts w...

1003 Emergency (25point(s))As an emergency rescue team leader of a city, you are given a special map of your country. The map shows several scattered cities connected by some roads. Amount of rescue ...

1002 A+B for Polynomials (25point(s))This time, you are supposed to find A+B where A and B are two polynomials.Input Specification:Each input file contains one test case. Each case occupies 2 lines...

1001 A+B Format (20point(s))Calculate a+b and output the sum in standard format – that is, the digits must be separated into groups of three by commas (unless there are less than four digits).Input ...

假设你是一位很棒的家长，想要给你的孩子们一些小饼干。但是，每个孩子最多只能给一块饼干。对每个孩子 i ，都有一个胃口值 gi ，这是能让孩子们满足胃口的饼干的最小尺寸；并且每块饼干 j ，都有一个尺寸 sj 。如果 sj >= gi ，我们可以将这个饼干 j 分配给孩子 i ，这个孩子会得到满足。你的目标是尽可能满足越多数量的孩子，并输出这个最大数值。注意：你可以假设胃口值为正。一个小...

在这里插入代码片class Solution {public: string toHex(int num) { string res = "", str = "0123456789abcdef"; int cnt = 0; while (num != 0 && cnt++ < 8) { res...

class Solution {public: string convertToTitle(int n) { string res; while (n) { res = char ((n - 1) % 26 + 'A') + res; n = (n - 1) / 26; //注意corner case: n=...

class Solution {public: int trailingZeroes(int n) { return n < 5 ? 0 : n/5 + trailingZeroes(n/5); //递归 }};

int res = 0, n = nums.size(), mid = n / 2; nth_element(nums.begin(), nums.begin() + mid, nums.end()); for (int i = 0; i < n; ++i) { res += abs(nums[i] - nums[mid]); ...

class Solution {public: bool isPerfectSquare(int num) { int subNum = 1; while (num > 0) { num -= subNum; subNum += 2; } return num == 0; }};

class Solution {public: bool isPowerOfThree(int n) { return n > 0 && 1162261467 % n == 0; }};

class Solution {public: vector<int> productExceptSelf(vector<int>& nums) { int n = nums.size(); vector<int> output(n,1);//初始化一个全为1的向量 for(int i=1;i&l...

class Solution {public: int maximumProduct(vector<int>& nums) { int max1 = INT_MIN ,max2= INT_MIN, max3 = INT_MIN, min1 = INT_MAX, min2 = INT_MAX; for (int n : nums) { ...

class Solution {public: string addBinary(string a, string b) { if (a.size() < b.size()) swap(a, b); reverse(a.begin(), a.end()); reverse(b.begin(), b.end()); ...

class Solution {public: string convertToBase7(int num) { if(num==0) return "0"; bool tag = false; if(num<0){ num=-num; tag=true; } ...

https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock-ii/class Solution {public: int maxProfit(vector<int>& prices) { int maxprofit=0; for(int i=1;i<price...

class Solution {public: int maxProfit(vector<int>& prices) { if(prices.size()==0) return 0; int minprice = prices[0],maxprofit = 0; for(int i=1;i<prices.size(...

bool cmp(const vector<int>& a,const vector<int>& b) { return a[0]>b[0]||(a[0]==b[0]&&a[1]<b[1]);}class Solution {public: vector<vector<int>&gt...

bool cmp(const vector<int>& a,const vector<int>& b) { return a[1]<b[1];}class Solution {public: int findMinArrowShots(vector<vector<int>>& interva...

bool cmp(const vector<int>& a,const vector<int>& b) { return a[1]<b[1];}class Solution {public: int eraseOverlapIntervals(vector<vector<int>>& int...

给定一个包含红色、白色和蓝色，一共 n 个元素的数组，原地对它们进行排序，使得相同颜色的元素相邻，并按照红色、白色、蓝色顺序排列。此题中，我们使用整数 0、 1 和 2 分别表示红色、白色和蓝色。注意:不能使用代码库中的排序函数来解决这道题。示例:输入: [2,0,2,1,1,0]输出: [0,0,1,1,2,2]进阶：一个直观的解决方案是使用计数排序的两趟扫描算法。首先，迭代计...

给定一个字符串，请将字符串里的字符按照出现的频率降序排列。示例 1:输入:“tree”输出:“eert”解释:'e’出现两次，'r’和’t’都只出现一次。因此’e’必须出现在’r’和’t’之前。此外，"eetr"也是一个有效的答案。示例 2:输入:“cccaaa”输出:“cccaaa”解释:'c’和’a’都出现三次。此外，"aaaccc"也是有效的答案。注意"cac...

347. 前K个高频元素题目描述给定一个非空的整数数组，返回其中出现频率前 k 高的元素。示例 1:输入: nums = [1,1,1,2,2,3], k = 2输出: [1,2]示例 2:输入: nums = [1], k = 1输出: [1]说明：你可以假设给定的 k 总是合理的，且 1 ≤ k ≤ 数组中不相同的元素的个数。你的算法的时间复杂度必须优于 O(n l...

leetcode 215题目描述在未排序的数组中找到第 k 个最大的元素。请注意，你需要找的是数组排序后的第 k 个最大的元素，而不是第 k 个不同的元素。样例示例 1:输入: [3,2,1,5,6,4] 和 k = 2输出: 5示例 2:输入: [3,2,3,1,2,4,5,5,6] 和 k = 4输出: 4说明:你可以假设 k 总是有效的，且 1 ≤ k ≤ 数组的...

class Solution {public: bool canPlaceFlowers(vector<int>& flowerbed, int n) { for(int i=0;i<flowerbed.size();i++) if(flowerbed[i]==0){ if((i==0||f...

双指针算法实用i,j两个变量，不会退的扫描一个数组常规写法for(int i=0,j=0,i<n;i++){ while(j<i&&check(i,j)) j++;}这是i,j从0开始扫，j<i的扫法for(int i=0,j=n-1;i<j;i++){ while(check()) j--;}这是i,j分别两端的写法或...