KAKADEE BLOG

1. 题目描述                                                                                                        Given s1, s2, s3, find whether s3 is formed by the interleaving of s1 and s2. Fo

1.题目 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 g

1.题目 Given a string containing just the characters '(' and ')', find the length of the longest valid (well-formed) parentheses substring. For "(()

1.题目 Implement next permutation, which rearranges numbers into the lexicographically next greater permutation of numbers. If such arrangement is not pos

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

1.题目 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 n

1.题目 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 algor

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 将k个有序链表合并成一个有序链表。 2.思路  第一种解法，设置两个指针p1,p2分别指向两个链

1.题目 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: "((()))

1.题目 Given a sorted array of integers, find the starting and ending position of a given target value. Your algorithm's runtime complexity mu

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 wer

1.题目 Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbe

1.题目 Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to 

1.题目 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" o

1.题目 Write a program to solve a Sudoku puzzle by filling the empty cells. Empty cells are indicated by the character '.'. You may assume

1.题目 Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules. The Sudoku board could be partially filled, where emp

1.题目 Divide two integers without using multiplication, division and mod operator. If it is overflow, return MAX_INT. 在不用乘号，除号，以及取余的情况下，计算两个

1.题目 Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 给你两个字符串haystack和

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

1.题目 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) a

1.题目 Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the ent

1.题目 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 be

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

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

1.题目 Write a function to find the longest common prefix string amongst an array of strings. 找出所有字符串的最长公共前缀。 2.思路  先找前两个字符串的最长公共前缀，然后后面的字符串和这个公共前缀逐一比较，不断更新这个前缀即可（这个前缀只可能越来

1.题目 Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 将整数（1-3999）转换成罗马数字。 2.思路  只要知道罗马数字的是怎么表示的： 1~9: {"I",

1.题目描述                                                                                                         Total Accepted: 117220 Total Submissions: 555265 Difficulty: Medium

1.题目描述                                                                                                         Total Accepted: 111540 Total Submissions: 513925 Difficulty: Medium

1.题目描述                                                                                                         Total Accepted: 171781 Total Submissions: 850971 Difficulty: Medium

1.题目 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 t

1.题目 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 t

1.题目 Determine whether an integer is a palindrome. Do this without extra space. 判断一个整数是否是回文数。 2.思路  此题so easy,负数不是回文数。直接贴代码： class Solution { public: bool isPalindro

1.题目 Implement atoi to convert a string to an integer. 将一个字符串转换为整型。 2.思路  atoi是面试官经常会问到的题目，主要是要考虑各种情形，那么一般的atoi有哪些要求呢？ 1. 对于输入字符串str,前面的空格忽略不计，从第一个非空字符串开始计数，第一个非空字符串只能

1.题目   Total Accepted: 79300 Total Submissions: 337482 Difficulty: Easy The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want

1.题目 Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 反转一个整数。 2.思路  此题无难度，注意int的界限问题。 int reverse(int x) { if(x==0) return 0

1.题目 Total Accepted: 98199 Total Submissions: 432790 Difficulty: Medium Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is

1.题目   Total Accepted: 85951 Total Submissions: 470608 Difficulty: Hard There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arr

1.题目 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. 将两个有序链表合并成一个有序链

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

1.题目 Given a collection of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbe