scwMason的博客

为了不断优化推荐效果，今日头条每天要存储和处理海量数据。假设有这样一种场景：我们对用户按照它们的注册时间先后来标号，对于一类文章，每个用户都有不同的喜好值，我们会想知道某一段时间内注册的用户（标号相连的一批用户）中，有多少用户对这类文章喜好值为k。因为一些特殊的原因，不会出现一个查询的用户区间完全覆盖另一个查询的用户区间(不存在L1<=L2<=R2<=R1)。 输入描述: 输入： 第1行为n代表用户的个数 第2行为n个整数，第i个代表用户标号为i的用户对某类文章的喜好度 第3行.

编写一个函数来查找字符串数组中的最长公共前缀。 如果不存在公共前缀，返回空字符串""。 示例1: 输入: ["flower","flow","flight"] 输出: "fl" 示例2: 输入: ["dog","racecar","car"] 输出: "" 解释: 输入不存在公共前缀。 说明: 所有输入只包含小写字母a-z。 链接：https://leetcode-cn.co...

Given an integer array, you need to find onecontinuous subarraythat if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order, too. You need to find ...

如果只是简单的将x循环n次进行乘积的话，一定会超时，所以，这里采用了对半分的方法，先看代码： double myPow(double x, int n) { double res=1.0; for(int i=n;i!=0;i/=2) { if(i%2!=0) res*=x; x*=x; }...

Given an array withnintegers, your task is to check if it could become non-decreasing by modifyingat most1element. We define an array is non-decreasing ifarray[i] <= array[i + 1]holds for ev...

Count the number of prime numbers less than a non-negative number,n. Example: Input: 10 Output: 4 Explanation: There are 4 prime numbers less than 10, they are 2, 3, 5, 7. 就是寻找比n小的素数有多少个 这里我们用了素...

Given a tree, rearrange the tree inin-orderso that the leftmost node in the tree is now the root of the tree, and every node has no left child and only 1 right child. Example 1: Input: [5,3,6,2,4,...

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Example: Input: 1->2->4, 1->3->4 Output: 1-...