摘要: 不得不说这是一次失败的骑行,因为我后悔了! 原始计划是这样的 路线:南京--上海 时间:4天 装备:山地车 景点:好好欣赏下南京到上海的每一个城市 但。。。事实情况是这样的: 上午我还在图书馆看书,中午我突然想出发了,我就收拾东西回宿舍收拾东西,山地车我还没来得及买,那就用我的小破自行车将就一下吧, 阅读全文
posted @ 2018-03-20 11:10 蒲公英的花朵 阅读(157) 评论(0) 推荐(0) 编辑
摘要: 写在开篇,之前看了很多很多电影,因为我很宅,哈哈,从文艺小清新的电影到丧尸片,各种战争片,悲剧喜剧,破案悬疑片等等,通吃哈,但是太唯美的韩国爱情片看的不多,总觉得现实很残酷呢!幽灵之类的小心脏受不了!以后每看完一部电影想记录下自己的观后感,来见证我的宅史。 ·想想之前看完电影或者别人问我这部电影怎么 阅读全文
posted @ 2017-10-14 21:37 蒲公英的花朵 阅读(1325) 评论(0) 推荐(0) 编辑
摘要: 怎没说也在百度呆了6个月嘛,,,还是写点啥纪念一下吧。。。 在部门最缺人的时候我去应聘的,总共3面,后来我才知道原来那个时候我们部门就只剩3个人,两轮技术面,一轮经理面,运气比较好,前一天看的算法题,那天面试全用上了,,,可能因为那个时候部门真的是太缺人了,然后就要我了。。。 然后我就把网易的实习给 阅读全文
posted @ 2017-09-21 20:47 蒲公英的花朵 阅读(160) 评论(0) 推荐(0) 编辑
摘要: 1 package day20170206; 2 //LeetCode:441. Arranging Coins 3 /* 4 You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. 5 Given n... 阅读全文
posted @ 2017-02-07 10:04 蒲公英的花朵 阅读(182) 评论(0) 推荐(0) 编辑
摘要: 1 package day20170206; 2 //LeetCode:374. Guess Number Higher or Lower 3 /* 4 We are playing the Guess Game. The game is as follows: 5 I pick a number from 1 to n. You have to guess which number... 阅读全文
posted @ 2017-02-07 10:03 蒲公英的花朵 阅读(207) 评论(0) 推荐(0) 编辑
摘要: 1 package day20170206; 2 //LeetCode:53. Maximum Subarray 3 /* 4 Find the contiguous subarray within an array (containing at least one number) which has the largest sum. 5 6 For example, given... 阅读全文
posted @ 2017-02-07 10:02 蒲公英的花朵 阅读(162) 评论(0) 推荐(0) 编辑
摘要: 1 package day20170206; 2 //LeetCode:367. Valid Perfect Square 3 /* 4 Given a positive integer num, write a function which returns True if num is a perfect square else False. 5 6 Note: Do not ... 阅读全文
posted @ 2017-02-07 10:02 蒲公英的花朵 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 1 package Today; 2 //LeetCode:476. Number Complement 3 /* 4 Given a positive integer, output its complement number. 5 The complement strategy is to flip the bits of its binary representation.... 阅读全文
posted @ 2017-02-06 11:25 蒲公英的花朵 阅读(238) 评论(0) 推荐(0) 编辑
摘要: 1 package Today; 2 //LeetCode:485. Max Consecutive Ones 3 /* 4 Given a binary array, find the maximum number of consecutive 1s in this array. 5 6 Example 1: 7 Input: [1,1,0,1,1,1] 8 Output: ... 阅读全文
posted @ 2017-02-06 11:25 蒲公英的花朵 阅读(146) 评论(0) 推荐(0) 编辑
摘要: 1 package Today; 2 //LeetCode:463. Island Perimeter 3 /* 4 You are given a map in form of a two-dimensional integer grid where 1 represents land and 0 represents water. 5 Grid cells are conne... 阅读全文
posted @ 2017-02-06 11:24 蒲公英的花朵 阅读(258) 评论(0) 推荐(0) 编辑