<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[学渣记事本]]></title><description><![CDATA[打渔还是晒网？]]></description><link>https://blog.youkuaiyun.com/wdlsjdl2</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; wdlsjdl2]]></copyright><item><title><![CDATA[配置备忘]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/66980193</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/66980193</guid><author>wdlsjdl2</author><pubDate>Mon, 27 Mar 2017 21:22:50 +0800</pubDate><description><![CDATA[manven  setting.xml




<!--
Licensed to the Apache Software Foundation (ASF) under one
or more contributor license agreements.  See the NOTICE file
distributed with this work for additional inform]]></description><category></category></item><item><title><![CDATA[靠近左、右的二分搜索例程]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/64921056</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/64921056</guid><author>wdlsjdl2</author><pubDate>Wed, 22 Mar 2017 16:27:17 +0800</pubDate><description><![CDATA[靠近左：只有当arr[mid]>1)，最后位置在lo


靠近右：只有当arr[mid]>target时才向左，上界hi推进，mid=lo+((hi-lo+1)>>1)，最后位置在hi


public class test649 {
	public static void main(String[] args) {
		int[] arr={1,1,1,1,2,2,3,4,5,6,6]]></description><category></category></item><item><title><![CDATA[面试题（微软）S-expression]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53980438</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53980438</guid><author>wdlsjdl2</author><pubDate>Mon, 02 Jan 2017 17:37:48 +0800</pubDate><description><![CDATA[S-expression is a prefix notation invented for and popularized by the programming language Lisp. Your task is to evaluate
 some simple S-expressions.
In this problem, S-expression is defined as:
1.]]></description><category></category></item><item><title><![CDATA[链式前向星]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53164075</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53164075</guid><author>wdlsjdl2</author><pubDate>Mon, 14 Nov 2016 20:38:52 +0800</pubDate><description><![CDATA[摘自
http://www.cnblogs.com/LQ-double/p/5971323.html

https://www.baidu.com/link?url=mJSzzTO-saQexGiBxZDXQzBLZArVveITjVSqBnLXU-_wixEOCZagAoy6VbvYqQs0&wd=&eqid=e579ac6d00002777000000065829af79



]]></description><category></category></item><item><title><![CDATA[全排列散列]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53159379</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53159379</guid><author>wdlsjdl2</author><pubDate>Mon, 14 Nov 2016 15:32:32 +0800</pubDate><description><![CDATA[//x为排列的排名，范围[0~n!-1]
	//n为字符的个数
	public static String intToArray(int x,int n)
	{
		boolean[] used=new boolean[n+1];
		StringBuilder sb=new StringBuilder();
		for(int i=1;i<=n;i++)
		{
			int temp=x/fa]]></description><category></category></item><item><title><![CDATA[素数晒法、素数Rabin测试、快速幂取模]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53156468</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53156468</guid><author>wdlsjdl2</author><pubDate>Mon, 14 Nov 2016 10:43:47 +0800</pubDate><description><![CDATA[素数筛法，产生num以内的素数表
public static int  makePrimes(int primes[], int num)
	{
		int i, j, cnt;
		primes[0] = 2;
		primes[1] = 3;
		for(i = 5, cnt = 2; i < num; i += 2)
		{
			boolean flag = true;
			for(j]]></description><category></category></item><item><title><![CDATA[欧拉函数]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53156375</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53156375</guid><author>wdlsjdl2</author><pubDate>Mon, 14 Nov 2016 10:28:25 +0800</pubDate><description><![CDATA[摘自
http://blog.youkuaiyun.com/once_hnu/article/details/6302868





欧拉函数

 

     对正整数n，欧拉函数是少于或等于n的数中与n互质的数的数目。例如euler(8)=4，因为1,3,5,7均和8互质。
     Euler函数表达通式：euler(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1]]></description><category></category></item><item><title><![CDATA[453. Minimum Moves to Equal Array Elements]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53149789</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53149789</guid><author>wdlsjdl2</author><pubDate>Sun, 13 Nov 2016 16:41:12 +0800</pubDate><description><![CDATA[Given a non-empty integer array of size n, find the minimum number of moves required to make all array elements equal, where a move is incrementing n - 1 elements by 1.

Example:
Input:
[1,2,3]

Ou]]></description><category></category></item><item><title><![CDATA[452. Minimum Number of Arrows to Burst Balloons]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53149240</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53149240</guid><author>wdlsjdl2</author><pubDate>Sun, 13 Nov 2016 15:30:26 +0800</pubDate><description><![CDATA[There are a number of spherical balloons spread in two-dimensional space. For each balloon, provided input is the start and end coordinates of the horizontal diameter. Since it's horizontal, y-coordin]]></description><category></category></item><item><title><![CDATA[447. Number of Boomerangs]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53148024</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53148024</guid><author>wdlsjdl2</author><pubDate>Sun, 13 Nov 2016 11:30:41 +0800</pubDate><description><![CDATA[Given n points in the plane that are all pairwise distinct, a "boomerang" is a tuple of points (i,
 j, k) such that the distance between iand j equals
 the distance between i and k (the
 order of t]]></description><category></category></item><item><title><![CDATA[446. Arithmetic Slices II - Subsequence]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53147146</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53147146</guid><author>wdlsjdl2</author><pubDate>Sun, 13 Nov 2016 09:51:10 +0800</pubDate><description><![CDATA[A sequence of numbers is called arithmetic if it consists of at least three elements and if the difference between any two consecutive elements is the same.

For example, these are arithmetic sequen]]></description><category></category></item><item><title><![CDATA[441. Arranging Coins]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106679</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106679</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 22:12:01 +0800</pubDate><description><![CDATA[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.]]></description><category></category></item><item><title><![CDATA[440. K-th Smallest in Lexicographical Order]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106659</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106659</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 22:08:29 +0800</pubDate><description><![CDATA[Given integers n and k,
 find the lexicographically k-th smallest integer in the range from 1 to n.

Note: 1 ≤ k ≤ n ≤ 109.

Example:
Input:
n: 13   k: 2

Output:
10

Explanation:
The lexicograp]]></description><category></category></item><item><title><![CDATA[438. Find All Anagrams in a String]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106503</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106503</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 22:04:24 +0800</pubDate><description><![CDATA[Given a string s and a non-empty string p, find all the start indices of p's anagrams in s.

Strings consists of lowercase English letters only and the length of both strings s and p will not be lar]]></description><category></category></item><item><title><![CDATA[437. Path Sum III]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106489</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106489</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 21:51:19 +0800</pubDate><description><![CDATA[You are given a binary tree in which each node contains an integer value.

Find the number of paths that sum to a given value.

The path does not need to start or end at the root or a leaf, but it]]></description><category></category></item><item><title><![CDATA[436. Find Right Interval]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106377</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106377</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 21:45:33 +0800</pubDate><description><![CDATA[Given a set of intervals, for each of the interval i, check if there exists an interval j whose start point is bigger than or equal to the end point of the interval i, which can be called that j is on]]></description><category></category></item><item><title><![CDATA[435. Non-overlapping Intervals]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106309</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106309</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 21:35:14 +0800</pubDate><description><![CDATA[Given a collection of intervals, find the minimum number of intervals you need to remove to make the rest of the intervals non-overlapping.

Note:


You may assume the interval's end point is alw]]></description><category></category></item><item><title><![CDATA[432. All O`one Data Structure]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106187</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106187</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 21:15:43 +0800</pubDate><description><![CDATA[Implement a data structure supporting the following operations:



Inc(Key) - Inserts a new key with value 1. Or increments an existing key by 1. Key is guaranteed to be a non-empty string.Dec(Key]]></description><category></category></item><item><title><![CDATA[424. Longest Repeating Character Replacement]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106123</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53106123</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 21:12:13 +0800</pubDate><description><![CDATA[Given a string that consists of only uppercase English letters, you can replace any letter in the string with another letter at most k times. Find the length of a longest substring containing all repe]]></description><category></category></item><item><title><![CDATA[423. Reconstruct Original Digits from English]]></title><link>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53105608</link><guid>https://blog.youkuaiyun.com/wdlsjdl2/article/details/53105608</guid><author>wdlsjdl2</author><pubDate>Wed, 09 Nov 2016 20:36:47 +0800</pubDate><description><![CDATA[Given a non-empty string containing an out-of-order English representation of digits 0-9,
 output the digits in ascending order.

Note:


Input contains only lowercase English letters.Input is g]]></description><category></category></item></channel></rss>