luzheqi的专栏

听说java9要移除Unsafe类了，真的吗

LeetCode 477. Total Hamming Distance

LeetCode 456. 132 Pattern

LeetCode 446. Arithmetic Slices II - Subsequence

LeetCode 452. Minimum Number of Arrows to Burst Balloons

LeetCode 179. Largest Number给出一个非负整型列表，对列表里的整型进行排序，使得排序后将这些数字连在一起的数字最大。

Qt信号槽给出了五种连接方式，使用Qt::UniqueConnection放置connect重复调用导致建立多个信号槽连接

LeetCode 174. Dungeon Game

LeetCode 173. Binary Search Tree Iterator

欢迎移步到我的个人博客 版权声明：本文为博主原创文章，转载请注明出处，谢谢! 很长时间不整理是很容易忘记的为什么要增加Algolia搜索插件第一个原因当然是这样可以让博客显得更加炫酷；其次就是原来常用的swiftype插件不再免费，而且Algolia不仅免费，感觉上要比Swiftype要快。 就没有别人有写相关博客吗你可能会有这样的疑问。我的回答是当然有，例如Hexo集成A

1 起因起因有两点吧，第一点就是最不能忍得，就是不能在离线使用，虽然这个我已经忍受了很久；第二点就是现在强制限制2天同时登录，我看了一下我现在一共有5台设备，每次打开印象笔记的时候都要提醒我只能两台，太气人了。至于为什么用有道云笔记，没有什么原因。2 印象笔记导出导出很简单，首先是选择文件，然后选择导出。接着选择导出为ENEX格式文件(.enex)，最后选择导出

QT中出现这种重复定义的问题很正常问题QT中引入OpenCV在编译的时候出现了下面的问题：F:\workspace\show\xhxzbzs\LiveEncoder\3rdparty\libopencv249\include\opencv2\stitching\detail\warpers_inl.hpp:146: error: C2589: “(”:“::”右边的非法标记f:\workspac

点击打开链接[plain] view plaincopyADMIN_PASSWORD=password  MYSQL_PASSWORD=stackdb  RABBIT_PASSWORD=stackqueue  SERVICE_PASSWORD=$ADMIN_PASSWORD  #enable_service ral

点击打开链接在python中使用pdb模块可以进行调试import pdbpdb.set_trace()也可以使用python -m pdb mysqcript.py这样的方式(Pdb) 会自动停在第一行，等待调试,这时你可以看看 帮助(Pdb) h    说明下这几个关键 命令>断点设置    (Pdb)b  10 #断点设置在本py的第10行

在Nova的源码中，基本上所有的lei

转自: 点击打开链接Paste.Deploy主要是用来载入WSGI中的Web App使用，其核心函数是loadapp(),下文中PD就指代Paste.Deploy。OS:Ubuntu12.04 2012年11月17日 第一版 主要是对官方文档的一个翻译，外加自己的一些理解 本文的Paste.Deploy使用主要是针对WSGI1 简介及安装Paste Deployment是一种机制，通过lo

1  WSGI 程序 起步

写在最前面以keystone工程为例，其他工程类似内容包括：打源码包（sdist）、单元测试（UT）、测试覆盖率（coverage）、代码格式检查（pep8，flake）1、引子接触了一段时间openstack社区，并提交了几个bug之后，就发现社区中，从bug提交、问题确认、到bug修复，代码review，自动构建、单元测试、静态检查、再到代码合入，也就是我们经常说的持续

原文地址

首先贴一段代码

1 Decorators for Functions and Methods

1. DashBoard

1.练习2.73a没有必要b(define (insert-sum-proc) (define (deriv-sum exp var) (make-sum (deriv (car exp) var) (deriv (cadr exp) var))) (put 'deriv '+ deriv-sum) 'done)(define (

1.练习2.53'(a b c)'((george))'((y1 y2))'(y1 y2)#f#f'(red shoes blue socks)2.练习2.54(define (equal? s1 s2) (cond ((and (null? s1) (null? s2)) true) ((or (null? s1) (null? s

1.练习2.48(define (make-segment start end) (cons start end))(define (start-segment seg) (car seg))(define (end-segment seg) (cdr seg))2.练习2.49(require (planet "sicp.ss" ("soegaard" "sicp

1.练习1.23改后的代码如下：(define (find-divisor-better n a) (cond ((> (square a) n) n) ((divides?-better n a) a) (else (find-divisor-better n (next-2 a)))))(define (next-2 n) (if (= 2 n) (+ 1

1.练习2.21(define (square-list items) (if (null? items) '() (cons (square (car items)) (square-list (cdr items)))))(define (square-list items) (map (lambda (x) (square x)) items))2

1.练习2.41(define (seprate-except x except) (filter (lambda (couple) (let ((first (car couple)) (second (cadr couple))) (and (not (= first except))

1.练习2.11(define (mul-interval x y) (let ((x1 (lower-bound x)) (x2 (upper-bound x)) (y1 (lower-bound y)) (y2 (upper-bound y))) (let ((zzx (and (>= x1 0) (>= x2 0))) (zzy (and (>= y1 0) (>

1.练习2.2(define (make-segment start end) (cons start end))(define (start-segment seg) (car seg))(define (end-segment seg) (cdr seg))(define (make-point x y) (cons x y))(define (x-poin

1.练习2.1(define (check-pos-neg a b) (or (and (not ( b 0)) (and (not (> a 0)) (< b 0))))(define (make-rat n d) (let ((g (gcd (abs n) (abs d))) (posi (check-pos-neg n d))) (cons (/ (if

1.练习1.40(define (cubic a b c) (define (cube x) (* x x x)) (lambda (x) (+ (cube x) (* a (square x)) (* b x) c)))(define (newtons-method g guess) (fixed-point (ne

1.练习1.35(fixed-point (lambda (x) (+ 1 (/ 1 x))) 1.0)2.练习1.36不用平均阻尼方式：(fixed-point-display (lambda (x) (/ (log 1000) (log x))) 2.0)结果为：2.9.9657842846620873.0044722098412146.2791957575071

最近对于Lisp的强大和高深还是深有体会的，可以将函数作为参数进行调用，这样在很大的程度上可以提高函数的抽象性，即将具有公共模式的函数进行抽象。例如在SICP中，首先将累加和的过程进行了抽象，然后在累加和的基础上抽象出了累乘积，进而又发现了累加和与累乘积的共同点，进一步抽象成了一个叫做accumulate的函数，这个函数的是这样的(accumulate combiner null-value

1.练习1.23改后的代码如下：(define (find-divisor-better n a) (cond ((> (square a) n) n) ((divides?-better n a) a) (else (find-divisor-better n (next-2 a)))))(define (next-2 n) (if (= 2 n) (+

1.练习1.18(define (*-iter a b n) (cond ((= n 0) a) ((even? n) (*-iter a (double b) (halve n))) (else (*-iter (+ a b) b (- n 1)))))(define (* b n) (*-iter 0 b n))Lisp真是强大啊，连 *-iter这种函数名也可以使用！

1.练习1.10表达式的求值就不说了。(define (f n) (A 0 n)) -------2n(define (g n) (A 1 n))-------2的n次方(define (h n) (A 2 n))-------n个2的次方，例如：(h 4)表示为2的2次方的2次方的2次方2.练习1.11递归计算过程：(define (f1 n) (if (< n

1. 练习1.1这个题没有什么好说的了，只要把代码敲出来，运行一遍就可以了。2. 练习1.2这个题应该不算难吧，没有看过别人的答案，我把我的贴出来吧。(/ (+ 5 4 (- 2 (- 3 (+ 6 (/ 4 5))))) (* 3 (- 6 2) (- 2 7)))3.练习1.3我的方法是求出3个数的和，再将减去最小的数，算不上最好的方法吧，马马虎虎。(def

原地址：点击打开链接;;使用C-x C-e检测配置的正确性(global-linum-mode t);显示行号(setq column-number-mode t);显示列号(setq auto-image-file-mode t);让Emacs可以直接打开和显示图片(auto-compression-mode t);打开压缩文件时自动解压缩;(setq global-font-lo

最近终于下定决心学习一下lisp，打算从SICP开始吧。编辑器打算采用Emacs，原因是它是用C和Emacs Lisp（Lisp的一种方言）编写的程序。Emacs还真的是难学啊，在掌握了基本（基本）的操作后，开始配置Emacs的环境，参考的很多网上的一些代码，就不多说了。这里要说的是我在借鉴了大牛王垠的配置后，在使用的时候会报一个找不到find函数的的错误，源代码如下：(defun

点击打开链接Emacs是用Buffer来组织编辑区域的，一个Buffer就代表一个文件或者一个临时编辑区域，我们可以用一些函数来切换到前一个或后一个Buffer，也可以列出所有的Buffer来进行选择。一些现代编辑器都支持一种特性，那就是Tab，用标签来列出所有的文件并可以方便地在文件之间切换，直观而方便。万能的Emacs当然也可以做到这个。增加标签特性需要tabbar

1.  clojure-bloghttps://github.com/baoliang/clojure-blog

转载请注明出处：http://blog.csdn.net/guolin_blog/article/details/8714621人人客户端有一个特效还是挺吸引人的，在主界面手指向右滑动，就可以将菜单展示出来，而主界面会被隐藏大部分，但是仍有左侧的一小部分同菜单一起展示。据说人人客户端的这个特效是从facebook客户端模仿来的，至于facebook是不是又从其它地方模仿来的就不

出处：点击打开链接看到大家在讨论github的使用，我用的也不多，偶尔clone一些好的源代码而已。我用的是Eclipse的插件EGit，全部操作直接在eclispe里就可以完成了，哈哈，我比较懒，官网上教的那些git clone 什么的高深操作我也不会，感觉egit还是比较好用的，所以上网搜了一个关于egit的详细操作的帖子，现在搬过来和大家一起分享一下。我找到的这个帖子的地址是：http:

原文链接： Bob Nystrom   翻译： 伯乐在线 - deathmonkey译文链接： http://blog.jobbole.com/53376/本文由 伯乐在线 - deathmonkey 翻译自 Bob Nystrom。欢迎加入技术翻译小组。转载请参见文章末尾处的要求。伯乐在线补充：本文作者 Bob Nystrom 是 Google Dart

点击打开链接一.前言最近在学习2dx，看了几个源码，手很是痒痒，下面跟我一下编写一个类似保卫大萝卜的塔防游戏吧。二.不废话开始编代码。我用的cocos2d-x 的版本是2.04 ，编辑器是vs2010.首先创建一个工程，我们取名字叫“TDgame”。之后我们添加几个常用到的模块。 1.动画管理器，Ani

Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: ["2", "1", "+",

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. public int maxPoints(Point[] points) { // IMPORTANT: Please reset any member data you declared

Sort a linked list using insertion sort. public ListNode insertionSortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reus

Sort a linked list in O(n log n) time using constant space complexity. public ListNode sortList(ListNode head) { // IMPORTANT: Please reset any member data you declared, as // the same Solutio

点击打开链接最近新做了一个模板的LOGO，为了让其更具美观和平滑型因此需要把图片角部修改为圆角，PS新手不防学习一下。1.打开PhotoShop,并找开要处理的图片;2.使用工具栏中的"矩形"工具,并对其如下设置:在写有"注意"字样的地方,这个按钮表示用此工具建立路径,路径的作用也就是为了我们 [ 3.转换成选区(快捷键:Ctrl+Enter) ]

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.get(key) - Get the value (will always be positive) of the key if

Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [3,2,1]. public ArrayList pos

Given a binary tree, return the preorder traversal of its nodes' values.For example:Given binary tree {1,#,2,3}, 1 \ 2 / 3return [1,2,3].Note: Recursive soluti

Given a singly linked list L: L0→L1→…→Ln-1→Ln,reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…You must do this in-place without altering the nodes' values.For example,Given {1,2,3,4}, reorder it to {1,4

Given a linked list, return the node where the cycle begins. If there is no cycle, return null.Follow up:Can you solve it without using extra space?点击打开链接 public ListNode detectCycle(ListNod

Given a linked list, determine if it has a cycle in it.Follow up:Can you solve it without using extra space? public boolean hasCycle(ListNode head) { // IMPORTANT: Please reset any

Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word.Return all such possible sentences.For example, givens = "

Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"

A linked list is given such that each node contains an additional random pointer which could point to any node in the list or null.Return a deep copy of the list. public RandomListNode copyRan

Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without usi

Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using ext

There are N children standing in a line. Each child is assigned a rating value.You are giving candies to these children subjected to the following requirements:Each child must have at least on

There are N gas stations along a circular route, where the amount of gas at station i is gas[i].You have a car with an unlimited gas tank and it costs cost[i] of gas to travel from station i to

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:Only one letter can be changed at a timeEach intermediate word must exi

Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors.OJ's undirected graph serialization:Nodes are labeled uniquely.We use # as a separator for ea

Reverse a linked list from position m to n. Do it in-place and in one-pass.For example:Given 1->2->3->4->5->NULL, m = 2 and n = 4,return 1->4->3->2->5->NULL.Note:Given m, n satisfy t

Given a collection of integers that might contain duplicates, S, return all possible subsets.Note:Elements in a subset must be in non-descending order.The solution set must not contain dupli

Follow up for "Search in Rotated Sorted Array":What if duplicates are allowed?Would this affect the run-time complexity? How and why?Write a function to determine if a given target is in the

Follow up for "Remove Duplicates":What if duplicates are allowed at most twice?For example,Given sorted array A = [1,1,1,2,2,3],Your function should return length = 5, and A is now [1,1,2,2,

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[ [ 1, 2, 3 ], [ 8, 9, 4 ], [

Given 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, whe

There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). public double findMedianSortedAr

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. Fo

You 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 return it as a link

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. public String lon

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P L S I

Reverse digits of an integer.Example1: x = 123, return 321Example2: x = -123, return -321click to show spoilers.Have you thought about this?Here are some good questions to ask before coding.

Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca

Determine whether an integer is a palindrome. Do this without extra space.click to show spoilers.Some hints:Could negative integers be palindromes? (ie, -1)If you are thinking of convertin

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Fin

Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999. static List r2a = new ArrayList(); static { r2a.add(new R2A(1000, 'M')); r2a.

Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999. static Map r2a = new HashMap(); static { r2a.put('I', 1); r2a.put('V', 5);

Write a function to find the longest common prefix string amongst an array of strings. public String longestCommonPrefix(String[] strs) { // Start typing your Java solution below // DO NOT wri

Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.Note:Elements

Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exact

Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c)

Given a digit string, return all possible letter combinations that the number could represent.A mapping of digit to letters (just like on the telephone buttons) is given below.Input:Digit string

Given a linked list, remove the nth node from the end of list and return its head.For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The brackets must close in the correct order, "()" and "()[]{}" are all va

Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.For example, given n = 3, a solution set is:"((()))", "(()())", "(())()", "()(())", "()()

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. public ListNode mergeKLists(ArrayList lists) { // IMPORTANT: Please reset any member data you

Given a linked list, swap every two adjacent nodes and return its head.For example,Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. Y

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with

Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn't matter what you leave beyond the new length. pu

Divide two integers without using multiplication, division and mod operator. public int divide(int dividend, int divisor) { // IMPORTANT: Please reset any member data you declared, as // the s

You are given a string, S, and a list of words, L, that are all of the same length. Find all starting indices of substring(s) in S that is a concatenation of each word in L exactly once and without an

public void nextPermutation(int[] num) { // IMPORTANT: Please reset any member data you declared, as // the same Solution instance will be reused for each test case. List rest = new ArrayList();