Happiness is more than pleasure without pain

你只有非常努力,才能看起来毫不费力

导航

2014年10月18日 #

模拟退火算法

摘要: //模拟退火算法效果稍稍好于爬山算法,核心思想是以一定的概率接受一个比当前解更差的解public Individual solve(final IObjectiveFunction f) { Individual pcur, pnew; Random r =new Random(); pcur... 阅读全文

posted @ 2014-10-18 09:41 believer 阅读(142) 评论(0) 推荐(0) 编辑

leetcode难度及面试频率

摘要: 转载自:LeetCode Question Difficulty Distribution1Two Sum25arraysortsetTwo Pointers2Add Two Numbers34linked listTwo PointersMath3Longest Substring Without... 阅读全文

posted @ 2014-10-18 09:23 believer 阅读(171) 评论(0) 推荐(0) 编辑

Search in Rotated Sorted Array

摘要: Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2).You are given a target value t... 阅读全文

posted @ 2014-10-18 09:12 believer 阅读(123) 评论(0) 推荐(0) 编辑