p441

发表于 2016-11-27 | 分类于 blog

LeetCode p441 Arranging Coins 题解

1.题目：

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.

Given n, find the total number of full staircase rows that can be formed.

n is a non-negative integer and fits within the range of a 32-bit signed integer.

Example 1:

n = 5

The coins can form the following rows:
¤
¤ ¤
¤ ¤

Because the 3rd row is incomplete, we return 2.

Example 2:

n = 8

The coins can form the following rows:
¤
¤ ¤
¤ ¤ ¤
¤ ¤

Because the 4th row is incomplete, we return 3.

阅读全文 »

SqlLib学习记录

发表于 2016-11-26 | 分类于 bolg

##SqlLib学习记录

###预备：环境搭建与资源
https://github.com/Audi-1/sqli-labs
http://www.cnblogs.com/sylarinfo/p/3456445.html

开始尝试在kali上面搭建，完成之后打开本地代码出现 403 forbidden
调整配置无果可能还要折腾防火墙参考的博客比较少
所以先在Windows上搭建了

###Less-1

Java学习tips

发表于 2016-11-26

Android学习tips

发表于 2016-11-26

p416

发表于 2016-11-23 | 分类于 blog

LeetCode p416 Partition Equal Subset Sum 题解

1.题目：

Given a non-empty array containing only positive integers, find if the array can be partitioned into two subsets such that the sum of elements in both subsets is equal.
Note:

Each of the array element will not exceed 100.
The array size will not exceed 200.

Example 1:

Input: [1, 5, 11, 5]

Output: true

Explanation: The array can be partitioned as [1, 5, 5] and [11].

Example 2:

Input: [1, 2, 3, 5]

Output: false

Explanation: The array cannot be partitioned into equal sum subsets.

阅读全文 »

p393

发表于 2016-10-19 | 分类于 blog

LeetCode p393 UTF-8 Validation 题解

1.题目：

A character in UTF8 can be from 1 to 4 bytes long, subjected to the following rules:

For 1-byte character, the first bit is a 0, followed by its unicode code.
For n-bytes character, the first n-bits are all one's, the n+1 bit is 0, followed by n-1 bytes with most significant 2 bits being 10.

This is how the UTF-8 encoding would work:

Given an array of integers representing the data, return whether it is a valid utf-8 encoding.

阅读全文 »