强哥快飞

题目： 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.

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 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

/** * Given a sorted linked list, delete all duplicates such that each element appear only once. * */很简单，没有啥可说的public void removeDuplicates(ListNode node){ListNode cur = node;while(cur!=

题目：输入一个整数，求该整数的二进制表达中有多少个1。例如输入10，由于其二进制表示为1010，有两个1，因此输出2。分析：这是一道很基本的考查位运算的面试题。包括微软在内的很多公司都曾采用过这道题。一个很基本的想法是，我们先判断整数的最右边一位是不是1。接着把整数右移一位，原来处于右边第二位的数字现在被移到第一位了，再判断是不是1。这样每次移动一位，直到这个整数变成0为止。现在的

/** *  * 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. * */key Notethe solution is sam

/** * Given a non-negative number represented as an array of digits, plus one to * the number. *  * The digits are stored such that the most significant digit is at the head of * the list.

/** * Given two binary strings, return their sum (also a binary string). *  * For example, a = "11" b = "1" Return "100". *  * 题目翻译： *  * 给定两个二进制字符串，返回它们的和（也是一个二进制字符串）。 例如， a = "11" b =

题目：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.其实就是查找的扩展两种， 递归和迭代 // 递归 pub

题目：/** * Find the contiguous subarray within an array (containing at least one number) * which has the largest sum. For example, given the array [-2, 1, -3, 4, -1, * 2,1, -5, 4 ], the contiguo

题目/** *  * Given a string s consists of upper/lower-case alphabets and empty space * characters ' ', return the length of last word in the string. *  * If the last word does not exist, ret

题目: * Given two binary strings, return their sum (also a binary string). *  * For example, a = "11" b = "1" Return "100". *  * 题目翻译： *  * 给定两个二进制字符串，返回它们的和（也是一个二进制字符串）。 例如， a = "11" b =

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 sol