本月博客排行
年度博客排行
-
第1名
宏天软件 -
第2名
青否云后端云 -
第3名
龙儿筝 - wallimn
- gashero
- vipbooks
- wy_19921005
- benladeng5225
- fantaxy025025
- zysnba
- ssydxa219
- e_e
- sam123456gz
- javashop
- arpenker
- kaizi1992
- tanling8334
- xpenxpen
- xiangjie88
- wiseboyloves
- ganxueyun
- xyuma
- sichunli_030
- wangchen.ily
- lemonhandsome
- jh108020
- zxq_2017
- jbosscn
- Xeden
- zhanjia
- luxurioust
- lzyfn123
- forestqqqq
- ajinn
- nychen2000
- wjianwei666
- johnsmith9th
- daizj
- hanbaohong
- ranbuijj
- 喧嚣求静
- kingwell.leng
- silverend
- lchb139128
- lich0079
- kristy_yy
- jveqi
- java-007
- sunj
- yeluowuhen
最新文章列表
Spring之 context:exclude-filter 与 context:include-filter
1.在Spring的applicationContext.xml(主容器)中,将Controller(控制器)的注解打消掉
<context:component-scan base-package="com">
<context:exclude-filter type="annotation" experessio ...
LeetCode: Same Tree
题目描述:
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
使用遍历 ...
Leetcode: Add Binary
题目描述:
Given two binary strings, return their sum (also a binary string).
For example,a = "11"b = "1"Return "100".
LeetCode: Merge Sorted Array
题目描述:
Given two sorted integer arrays A and B, merge B into A as one sorted array.
Note:You may assume that A has enough space to hold additional elements from B. The number of elements initializ ...
LeetCode: Reverse Integer
题目描述:
Reverse digits of an integer.
Example1: x = 123, return 321Example2: x = -123, return -321
翻转数字,读入数字之后分别得到最低位,次低位...,每次添 ...
LeetCode: Climbing Stairs
题目描述:
You are climbing a stair case. It takes n steps to reach to the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
实际上是斐波那契数列,第n steps的方 ...
Windows同步机制总结
临界区
在所有同步对象中,临界区是最容易使用的,但它不是内核对象,只能用于同步单个进程中的线程。临界区一次只允许一个线程取得对某个数据区的访问权。还有,在这些同步对象中,只有临界区不是内核对象,它不由操作系统的低级部件管理,而且不能使用句柄来操纵。
由于使用时不需要从用户态切换到核心态,所以速度很快(X86系统上约为20个指令周期),非常适合于序列化对一个进程中的数据的访问,但其缺点是不能跨 ...