cow__sky的专栏

题目原型为：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 in

题目原型：Write a function to find the longest common prefix string amongst an array of strings.分别字符串数组中的每个字符串进行扫描对比，设置一个临时变量保存每次的比较的结果。//取得两个字符串的最长公共前缀 public String getLongestStr(String one , Stri

题目原型：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 t

问题：1、如何判断一个链表是不是这类链表？2、如果链表为存在环，如何找到环的入口点？先来认识下这个带环链表：对于第一个问题，我们就会要找在表中是否存在环，方法如下：设置两个指针(fast, slow)，初始值都指向头，slow每次前进一步，fast每次前进二步，如果链表存在环，则fast必定先进入环，而slow后进入环，两个指针必定相遇。（肯定是在环内相

题目原型Given a roman numeral, convert it to an integer.Input is guaranteed to be within the range from 1 to 3999.首先要认识一些罗马符号：I表示1，V表示5，X表示10，L表示50，C表示100，D表示500，M表示1000. 然后，从前往后扫描字符串，设置4个变量：临

Validate if a given string is numeric.Some examples:"0" => true" 0.1 " => true"abc" => false 不能为全字母"1 a" => false 不能含有字母(e另外算)"2e10" => true 可以含有e科学表达式表示的数"e9";//false 科学表达式前面不能没有数值，

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:"((()))", "(()())", "(())()", "()(())", "()()()"

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 solution is trivial, could you do it iteratively?

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,2,3}.

Implement int sqrt(int x).Compute and return the square root of x.

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.

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 the key exists in the cache, otherwise return -1.set(key,

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 the following condition:1 ≤ m ≤ n ≤ length of list.

归并排序的一种比较快的排序，尤其在链表中，在所有排序中是时间复杂度为nlog(n)级别的有三种，分别为快速排序，堆排序和归并排序，但是快速排序在单链表中没有优势（适合于双向链表），同样堆排序在建堆和调整堆得过程对于单链表也是比较麻烦，这里我们选取了归并排序。归并排序的概念和原理我就不介绍了，网上的相关资料比较多。在这里，我只想记录一个思路，归并的排序分为三步走：1 分割，2 递归，3 合并。

Divide two integers without using multiplication, division and mod operator.

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.You may not alter the values in the nodes, only nodes i

Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers.If such arrangement is not possible, it must rearrange it as the lowest possible order (ie, sorted in ascending order).The replacement m

Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring.For "(()", the longest valid parentheses substring is "()", which has length = 2.Another example is ")()())", where the

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.

The gray code is a binary numeral system where two successive values differ in only one bit.Given a non-negative integer n representing the total number of bits in the code, print the sequence of gray code. A gray code sequence must begin with 0.

Suppose a sorted array is rotated at some pivot unknown to you beforehand.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found in the array return its index, otherwise return -1.You may assume no duplicate

Given a sorted linked list, delete all duplicates such that each element appear only once.

Implement pow(x, n).

Given an unsorted integer array, find the first missing positive integer.For example,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your algorithm should run in O(n) time and uses constant space.

Given a set of non-overlapping intervals, insert a new interval into the intervals (merge if necessary).You may assume that the intervals were initially sorted according to their start times.Example 1:Given intervals [1,3],[6,9], insert and merge [2,5

大整数相乘。

全排列在笔试面试中很热门，因为它难度适中，既可以考察递归实现，又能进一步考察非递归的实现，便于区分出考生的水平。所以在百度和迅雷的校园招聘以及程序员和软件设计师的考试中都考到了，因此本文对全排列作下总结帮助大家更好的学习和理解。对本文有任何补充之处，欢迎大家指出。首先来看看题目是如何要求的（百度迅雷校招笔试题）。用C++写一个函数, 如 Foo(const char *str),

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, then one 1" or 1211.Given an integer n, generate the nt

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 contiguous subarray [4,−1,2,1] has the largest sum = 6.

Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm's runtime complexity must be in the order of O(log n).If the target is not found in the array, return [-1, -1].For example,Given [5, 7, 7,

You are given an n x n 2D matrix representing an image.Rotate the image by 90 degrees (clockwise).Follow up:Could you do this in-place?

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", "code"].Return true because "leetcode" can be segmented

题目原型：Implement strStr().Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.

The set [1,2,3,…,n] contains a total of n! unique permutations.

题目原型：Given a collection of numbers that might contain duplicates, return all possible unique permutations.For example,[1,1,2] have the following unique permutations:[1,1,2], [1,2,1], and

java集合之迭代器ListIterator首先，我们来看一段程序： public static void main(String[] args) { ArrayList list = new ArrayList(); list.add(1); list.add(2); list.add(3); list.add(4); for(ListIterator iter = list.listIterator();i

题目原型：Given a collection of numbers, return all possible permutations.For example,[1,2,3] have the following permutations:[1,2,3], [1,3,2], [2,1,3], [2,3,1], [3,1,2], and [3,2,1].基本

You are climbing a stair case. It takes n steps to reach to the top.Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

Given an array of non-negative integers, you are initially positioned at the first index of the array.Each element in the array represents your maximum jump length at that position.Your goal is to reach the last index in the minimum number of jumps.F