不可不戒

/** * 先排序数组.从小开始遍历数组求:-arr[i]=arr[x] + arr[y],y>x>i * 问题变成2Sum * Created by lezg on 16/4/5. */public class Solution { List<List<Integer>> res = new ArrayList<>(); public List<List<Integer>>

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. You may no

Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.Example: Given a = 1 and b = 2, return 3./** * 不用 + -实现两个数相加 * 两个数转换为二进制, * 1.各位数不进位,即异或运算

Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.You may assume no duplicates in the array.Here

The 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 as “one 2, the

You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses

After robbing those houses on that street, the thief has found himself a new place for his thievery so that he will not get too much attention. This time, all houses at this place are arranged in a cir

Given 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: “A scien

Given 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,null,null,15,7], 3 / \ 9 20

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, given s =”leetcode”, dict =[“leet”, “co

Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack./** * 字符串haystack是否存在子串needle * @param haystack * @param needl

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 valid but “

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * Created by ustc-lezg on 16/4/7. */public class Solu

/** * 求数组两个数的和等于给定的数 * 先排序数组. * Created by lezg on 16/4/5. */public class Solution { public int[] twoSum(int[] nums, int target) { int len = nums.length; int[] nums_sorted = new

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 linke

Reverse digits of an integer.Example1: x = 123, return 321 Example2: x = -123, return -321/** * 翻转整数,注意溢出. * Created by ustc-lezg on 16/4/6. */public class Solution { public static void main(St

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 cases.N

Determine whether an integer is a palindrome. Do this without extra space./** * 判断整数是否为回文, * 负数不是,10整数倍不是.0~9是. * Created by ustc-lezg on 16/4/6. */public class Solution { public boolean isPali

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). Find two lin

Write a function to find the longest common prefix string amongst an array of strings./** * 先排序数组,求所有字符串最长公共前缀, * 只需求排序后的第一个字符串和最后一个字符串公共前缀 * Created by ustc-lezg on 16/4/6. */public class Solutio

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.The order

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 linked list be

Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:Given nums = [1,