| 2016-09-07SpringMVC 入门使用本文主要参考了 imooc-SpringMVC 起步 视频教程和 SpringMVC 从入门到精通 系列 - HansonQ ,还有自己的一些总结。 主要内容: ...
| 2016-08-31刚刚毕业的两个月小结走出校园已经两个月了,因为之前的暑期也没怎么在家待过,大一在中康、大二在腾骏、大三在大为,大四毕业也就是现在,所以也没有什么特别的感觉。可以说,这两个月也做了些事情,学了些东西的。 从学校毕业,最直接的影响就是自己更加专注于计算机知识,不用再为学业担心。确定了先走技术的道路,也让自己不那么迷茫做什么。工作规律,自己开始读读书,才觉的读书是件有意思的事。也逼着自己常常写点东西,主要是觉的:写东西的时候自己会主动的思考,文笔练着练着也就能进步吧。 (一) DMV 是毕业后自己 ...
| 2016-08-31LeetCode Number of 1 Bits 191191. Number of 1 Bits  Write a function that takes an unsigned integer and returns the number of ’1’ bits it has (also known as the Hamming weight).  For example, the 32-bit integer ’11’ has binary repres ...
| 2016-08-29LeetCode Happy Number 202202. Happy Number  Write an algorithm to determine if a number is “happy”.  A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum o ...
| 2016-08-25LeetCode Roman to Integer 1313. Roman to Integer  Given a roman numeral, convert it to an integer.  Input is guaranteed to be within the range from 1 to 3999. wikipedia-罗马数字 罗马数字共有 7 个,即 I(1)、V(5)、X(10)、L(50)、C(100)、D(500)和 M(10 ...
| 2016-08-24LeetCode Majority Element 169169. Majority Element Given an array of size n, find the majority element. The majority element is the element that appears more than [ n/2 ] times. You may assume that the array is non-empty and the majority element always exist in th ...
| 2016-08-23LeetCode First Unique Character in a String 387387. First Unique Character in a String  Given a string, find the first non-repeating character in it and return it’s index. If it doesn’t exist, return -1.  Examples: s = "leetcode"return 0.s = ...
| 2016-08-23LeetCode Maximum Depth of Binary Tree 104104. Maximum Depth of Binary Tree  Given a binary tree, find its maximum depth.  The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 自己的解法自 ...
| 2016-08-22【此生为完成】随笔我们要用多大的代价,才能认清活着的意义?于娟,这个风华正茂的女子,拥有留洋经历和博士学位的复旦大学青年教师,在与晚期癌症抗争一年又四个月后,终于撒手人寰。她带走的家人的思念和不舍,给我们留下坚强的力量。 《此生未完成》这本书是上周末聚会时 Zhen 提到的,上周京东买书就带上了。书里前半探讨作者在生死临界时对生活、工作、名利、家人、朋友的一些看法和思考。这对于刚刚毕业的我来说,确实有些是无法真切体会到的,毕竟经历少。但是在书的字里行间中,仍然可以看到一个(不知道用什么词) ...
| 2016-08-22LeetCode Intersection of Two Arrays 349349. Intersection of Two Arrays  Given two arrays, write a function to compute their intersection.  Example:  Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. &ems ...