自定义博客皮肤VIP专享

*博客头图:

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

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

博客底图:

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

栏目图:

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

主标题颜色:

RGB颜色,例如:#AFAFAF

Hover:

RGB颜色,例如:#AFAFAF

副标题颜色:

RGB颜色,例如:#AFAFAF

自定义博客皮肤

-+
  • 博客(246)
  • 资源 (1)

原创 2016年终总结——学生时代的结束、北漂生活的开始

2016年流水账2016年,我的25周岁:6月30号读研毕业离校,7月4号北京工作入职。所以我的2016年可以很工整地划分成两部分:学生时代的结束、北漂生活的开始。我有写日记、周总结和月总结的习惯,所以回顾了整个2016年。学生时代的结束1月份:学校体育馆举办「跨年演唱会」,所以我是和小伙伴们在倒计时中进入2016年的。最心塞的是,我用微信小视频在倒计时8s时录制,因为小视频只能够录制7s,刚好错

2017-01-01 22:41:20 2500 4

原创 编程大师访谈录

什么是编程?人们对此一直各持己见。有人说它是科学,有人说它是艺术,还有人称之为技能或手艺。我认为这三方面兼而有之。我们喜欢说它蕴含大量艺术成分,但是我们都知道它里面更多的是科学。我觉得代码清单带给人的愉快同整洁的家差不多。你一眼就能分辨出家里是杂乱无章(比如垃圾和没洗的碟子到处乱扔)还是整洁如新。编程的第一步是想象。就是要在脑海中对来龙去脉有极为清晰的把握。在这个初始阶段,我会使用纸和铅笔。我只

2016-06-28 18:46:23 800

原创 我的电子学习之路

转眼间即将研究生毕业,我仍清晰地记得大一提着笨重的皮箱,迈入学校校门的场景。本科专业是测控技术与仪器,研究生专业是微电子学与固体电子学。回顾整个学生生涯,觉得有必要整理一下我的「电子学习之路」,算是对学生时代的总结吧!51 单片机大一时电子社团的学长给我们讲述单片机,当时觉得能用两行语句控制 LED 灯真的很神奇~后来在淘宝上买了郭天祥的单片机开发板(现在也很火吧……),把LED灯、按键、中断、串口

2016-06-22 19:55:27 1113

原创 Struts1 增删改查

文章说明本篇文章介绍如何使用Struts1进行增删改查,仅是对自己学习的记录,并没有深入分析每个模块(不重复造轮子O(∩_∩)O~)。Tomcat开源的Web应用服务器,apache-tomcat-8.0.35-windows-x64.zip仅有10.3M。启动服务:bin-startup.bat。数据库MySQL建立数据库test,并在其中建立表users。CREATE DATABASE test

2016-06-18 10:54:52 9218 1

原创 Struts2 Demo

下面两张图,用 viso 画了1个小时~ viso 很强大啊!工作原理Struts2的工作原理(图解)详解 Struts2基本原理工作流程Hello World DemoStruts 2 hello world (XML版本)web.xml配置 Struts 2<?xml version="1.0" encoding="UTF-8"?><web-app version="2.5" xmlns="

2016-06-18 10:53:49 1558

原创 Struts1 和 Struts2 对比

参考链接:http://blog.csdn.net/john2522/article/details/7436307Struts1 Action 官方注释Action.java 源代码中的注释如下:An Action is an adapter between the contents of an incoming HTTP request and the corresponding busines

2016-06-18 10:52:08 567

原创 Java 虚拟机面试题全面解析(干货)

《深入理解Java虚拟机》干货版~

2016-03-22 19:14:53 22470 5

原创 Android 振动

public class MainActivity extends Activity { private Button button; private Vibrator vibrator; @Override protected void onCreate(Bundle savedInstanceState) { super.onCreate(savedIn

2016-01-03 18:14:10 1396

原创 Android 子线程更新 UI

功能:每秒使 TextView 显示内容 +1。public class MainActivity extends Activity { private TextView textView; private Handler handler; @Override protected void onCreate(Bundle savedInstanceState) {

2016-01-03 17:30:30 540

原创 Android Button click 事件监听

Activity 实现 android.view.View.OnClickListener。public class MainActivity extends Activity implements android.view.View.OnClickListener { private Button button1, button2, button3; @Overrid

2016-01-03 16:54:37 780

原创 Android TCP 简单实现

说明测试程序分为两个部分:Android 客户端、Java 服务端。Android 客户端:连接指定IP和PORT,并发送“abcd”。Java 服务端:阻塞等待连接。Android 客户端public class MainActivity extends Activity { @Override protected void onCreate(Bundle savedInsta

2016-01-03 16:41:38 586

原创 Android 屏幕 width 和 height 的获取

WindowManager wm = this.getWindowManager(); int width = wm.getDefaultDisplay().getWidth(); int height = wm.getDefaultDisplay().getHeight(); System.out.println("width: " + width); System.o

2016-01-03 16:00:03 658

原创 Android UDP简单实现

说明测试程序分为两个部分:Android客户端、Java服务端。Android客户端:向局域网UDP广播字符串“Hello, World!”,端口号是11000。然后打印所有收到的UDP广播。Java服务端:监听11000的UDP广播,收到UDP广播后,发送一个JSON串。Android客户端public class MainActivity extends Activity { //

2016-01-03 15:53:40 722

原创 Android ListView的简单实现

Google官方文档http://developer.android.com/reference/android/widget/ListView.html http://developer.android.com/reference/android/app/ListActivity.html简单例子public class MainActivity extends ListActivity {

2016-01-03 13:05:48 476

原创 Android菜单

在Activity中,重写两个方法: @Override public boolean onCreateOptionsMenu(Menu menu) { getMenuInflater().inflate(R.menu.main, menu); return true; } @Override public boolean onOp

2016-01-03 12:13:59 1366

原创 Android获取WiFi IP地址

// 获取wifi服务 WifiManager wifiManager = (WifiManager) getSystemService(Context.WIFI_SERVICE); // 判断wifi是否开启 if (!wifiManager.isWifiEnabled()) { wifiManager.setWifiEnabled(true); }

2016-01-03 11:31:31 758

原创 Android uses-permission权限列表

Android有一个精心设计的安全模型。每一个应用都有其自己Linux用户和群组,在单独的进程和VM上运行,不能影响到其他应用。使用方式<uses-permission android:name="android.permission.INTERNET"/>常用权限 <uses-permission android:name="android.permission.INTERNET" />

2016-01-03 11:09:02 526

原创 LeetCode题目汇总

我的博客:http://blog.csdn.net/yano_nankai LeetCode题解:https://github.com/LjyYano/LeetCodeLeetCode之Array题目汇总 LeetCode之Hash Table题目汇总 LeetCode之Linked List题目汇总 LeetCode之Math题目汇总 LeetCode之String题目汇总 Leet

2016-01-03 10:38:00 1254

原创 Android对应版本号

系统号-API等级 系统号 API等级 4.2 17 4.3 18 4.4 19 4.4W 20 5.0 21 5.1 22 6.0 23Manifest文件 <uses-sdk android:minSdkVersion="14" android:targetSdkVersion="19" />

2016-01-03 10:36:14 422

原创 LeetCode之Design题目汇总

Implement Queue using StacksImplement the following operations of a queue using stacks.push(x) – Push element x to the back of queue.pop() – Removes the element from in front of queue.peek() – Get t

2015-12-30 10:39:53 1310 2

原创 LeetCode之Trie题目汇总

Implement Trie (Prefix Tree)Implement a trie with insert, search, and startsWith methods.Note: You may assume that all inputs are consist of lowercase letters a-z. class TrieNode { boolean i

2015-12-30 10:28:37 785

原创 LeetCode之Graph题目汇总

Course ScheduleThere are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course 0 you have to first take course 1, which is expre

2015-12-30 10:25:11 830

原创 LeetCode之Breadth-first Search题目汇总

Binary Tree Level Order TraversalGiven a binary tree, return the level order traversal of its nodes’ values. (ie, from left to right, level by level).For example: Given binary tree {3,9,20,#,#,15,7},

2015-12-30 10:21:34 559

原创 LeetCode之Depth-first Search题目汇总

Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every n

2015-12-30 09:57:11 591

原创 LeetCode之Tree题目汇总

Balanced Binary TreeGiven a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every n

2015-12-29 20:43:14 1380

原创 LeetCode之Bit Manipulation题目汇总

Bitwise AND of Numbers RangeGiven a range [m, n] where 0 <= m <= n <= 2147483647, return the bitwise AND of all numbers in this range, inclusive.For example, given the range [5, 7], you should return 4

2015-12-29 18:41:44 738

原创 LeetCode之Sort题目汇总

H-IndexGiven an array of citations (each citation is a non-negative integer) of a researcher, write a function to compute the researcher’s h-index.According to the definition of h-index on Wikipedia: “

2015-12-29 18:19:56 792

原创 LeetCode之Stack题目汇总

Basic CalculatorImplement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing parentheses ), the plus + or minus sign -, non-negative integers

2015-12-29 16:58:31 812

原创 LeetCode之Backtracing题目汇总

Combination SumGiven a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T.The same repeated number may be chosen from C unlimi

2015-12-29 13:18:37 506

原创 LeetCode之Dynamic Programming题目汇总

Best Time to Buy and Sell StockSay you have an array for which the ith element is the price of a given stock on day i.If you were only permitted to complete at most one transaction (ie, buy one and sel

2015-12-27 23:01:25 443

原创 LeetCode之Divide and Conquer题目汇总

Different Ways to Add ParenthesesGiven a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. The valid operators

2015-12-27 22:25:57 695

原创 LeetCode之Binary Search题目汇总

Count Complete Tree NodesGiven a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia: In a complete binary tree every level, except possibly the last, i

2015-12-27 21:46:54 490

原创 LeetCode之String题目汇总

Count and SayThe count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, ...1 is read off as "one 1" or 11. 11 is read off as "two 1s" or 21. 21 is read off

2015-12-27 16:28:05 535

原创 LeetCode之Math题目汇总

Add BinaryGiven two binary strings, return their sum (also a binary string).For example, a = "11" b = "1" Return "100". public ListNode addTwoNumbers(ListNode l1, ListNode l2) { if (l1 ==

2015-12-27 13:04:31 728

原创 LeetCode之Linked List题目汇总

Add Two NumbersYou are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and retur

2015-12-27 10:59:37 550

原创 LeetCode之Hash Table题目汇总

我的博客:http://blog.csdn.net/yano_nankai LeetCode题解:https://github.com/LjyYano/LeetCodeGroup AnagramsGiven an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "

2015-12-24 11:15:16 3292

原创 LeetCode 049 Group Anagrams

题目描述Given an array of strings, group anagrams together.For example, given: ["eat", "tea", "tan", "ate", "nat", "bat"], Return:[ ["ate", "eat","tea"], ["nat","tan"], ["bat"]]Note:For the retu

2015-12-24 10:14:52 419

原创 LeetCode之Array题目汇总

Two SumGiven an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, w

2015-12-23 19:28:39 3690

原创 LeetCode 033 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 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its i

2015-12-23 16:58:30 490

原创 LeetCode 300 Longest Increasing Subsequence

题目描述Given an unsorted array of integers, find the length of longest increasing subsequence.For example,Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101], therefor

2015-12-14 16:58:49 2345 3

Java 虚拟机面试题全面解析(干货)

Java 虚拟机面试题全面解析,《深入理解Java虚拟机》干货版,自己总结,希望能够帮助大家,免费下载~

2016-03-22

空空如也

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