自定义博客皮肤VIP专享

*博客头图:

格式为PNG、JPG,宽度*高度大于1920*100像素,不超过2MB,主视觉建议放在右侧,请参照线上博客头图

请上传大于1920*100像素的图片!

博客底图:

图片格式为PNG、JPG,不超过1MB,可上下左右平铺至整个背景

栏目图:

图片格式为PNG、JPG,图片宽度*高度为300*38像素,不超过0.5MB

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+

徐玄清的专栏

菜鸡一只

  • 博客(7)
  • 资源 (2)
  • 收藏
  • 关注

原创 LeetCode—376. Wiggle Subsequence

Wiggle Subsequence思路:贪心算法,每次只要跟前一个比,如果符合条件,则获取,如果不符合条件,说明提升了可以比较的空间GitHub地址:https://github.com/corpsepiges/leetcode目前java版本的答案大约进度是免费的差40题,python大约是一半,其他的等以后再补充。点此进入如果可以的话,请点一下star,谢

2016-07-26 10:04:33 647

原创 LeetCode—377. Combination Sum IV

Combination Sum IV思路:动态规划。GitHub地址:https://github.com/corpsepiges/leetcode目前java版本的答案大约进度是免费的差40题,python大约是一半,其他的等以后再补充。点此进入如果可以的话,请点一下star,谢谢。public class Solution { p

2016-07-25 12:08:55 1672

原创 LeetCode—375. Guess Number Higher or Lower II

Guess Number Higher or Lower II思路:刚开始的时候想到的不是动态规划,而是在(s,e)的范围内求出m,使得(s,m-1)=(m+1,e),结果发现两个问题,一个是不能使得两边相等时m靠左还是右,第二个问题更严重,因为题目中表示最后猜对的那一次是不要成本的。。。后来参考下,还是用dp来做。动态规划方程:matrix[s][e]=m+Math.max(matrix[s

2016-07-18 17:09:46 2032

原创 LeetCode—374. Guess Number Higher or Lower

Guess Number Higher or Lower思路:非常简单,就是二分法,注意二分的时候别超过int上限即可。GitHub地址:https://github.com/corpsepiges/leetcode点此进入/* The guess API is defined in the parent class GuessGame. @param n

2016-07-13 15:22:05 638

原创 LeetCode—372. Super Pow

Super Pow思路:利用两条公式 (ak+b)(ck+d)%k=bd;   a^b(假设b为偶数)=(a^(b/2))*a^(b/2);GitHub地址:https://github.com/corpsepiges/leetcode点此进入public class Solution { public int superPow(int

2016-07-12 09:46:58 643

原创 LeetCode—373. Find K Pairs with Smallest Sums

Find K Pairs with Smallest Sums思路:最简单的方法,写一个比较规则,直接比较GitHub地址:https://github.com/corpsepiges/leetcode点此进入public class Solution { public List kSmallestPairs(int[] nums1, int[] nums2, in

2016-07-08 11:03:27 630

原创 LeetCode—371. Sum of Two Integers

Sum of Two Integers思路:利用易或和与操作GitHub地址:https://github.com/corpsepiges/leetcode点此进入public class Solution { public int getSum(int a, int b) { return b==0?a:getSum(a^b,(a&b)<<

2016-07-08 10:43:22 215

2积分系列——经典算法与人工智能在外卖物流调度中的应用

系统首先通过优化设定配送费以及预计送达时间来调整订单结构;在接收订单之后,考虑骑手位置、在途订单情况、骑手能力、商家出餐、交付难度、天气、地理路况、未来单量等因素,在正确的时间将订单分配给最合适的骑手,并在骑手执行过程中随时预判订单超时情况并动态触发改派操作,实现订单和骑手的动态最优匹配。 同时,系统派单后,为骑手提示该商家的预计出餐时间和合理的配送线路,并通过语音方式和骑手实现高效交互;在骑手送完订单后,系统根据订单需求预测和运力分布情况,告知骑手不同商圈的运力需求情况,实现闲时的运力调度。

2018-04-26

Outlier Analysis 2nd Edition.pdf ——2积分系列

异常检测,第二版 This book provides comprehensive coverage of the field of outlier analysis from a computer science point of view. It integrates methods from data mining, machine learning, and statistics within the computational framework and therefore appeals to multiple communities. The chapters of this book can be organized into three categories:, Basic algorithms: Chapters 1 through 7 discuss the fundamental algorithms for outlier analysis, including probabilistic and statistical methods, linear methods, proximity-based met hods, high-dimensional (subspace) methods, ensemble methods, and supervised methods.Domain-specific methods: Chapters 8 through 12 discuss outlier detection algorithms for various domains of data, such as text, categorical data, time-series data, discrete sequence data, spatial data, and network data.Applications: Chapter 13 is devoted to various applications of outlier analysis. Some guidance is also provided for the practitioner., The second edition of this book is more detailed and is written to appeal to both researchers and practitioners. Significant new material has been added on topics such as kernel methods, one-class support-vector machines, matrix factorization, neural networks, outlier ensembles, time-series methods, and subspace methods. It is written as a textbook and can be used for classroom teaching.

2018-03-28

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人

提示
确定要删除当前文章?
取消 删除