buki26的博客

给定一棵二叉树，返回树的最小深度。最小深度是从根节点到叶子结点的最短路径。

Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given1->2->3->4->5->NULLand k =2, return4->5->1->2->3->NULL.

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.

Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given1->1->2, return1->2. Given1->1->2->3->3, return1->2->3.

给定一个链表和一个值，使小于这个值的节点在前，大于或等于的在后。 Given1->4->3->2->5->2and x = 3, return1->2->2->4->3->5.

Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. For example, Given1->2->3->3->4->4->5, return1->2->5. Given1->1->1->2-

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

Given a linked list, swap every two adjacent nodes and return its head. For example, Given1->2->3->4, you should return the list as2->1->4->3.

Given a linked list, remove the n th node from the end of list and return its head.

Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, “A man, a plan, a canal: Panama”is a palindrome. “race a car”is not a palin

Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number. An example is the root-to-leaf path1->2->3which represents the number123. Find the total sum of all

连接左右子节点

Given a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example: Given the below binary tree andsum =

给一颗二叉树，判断是否是平衡二叉树，（任意节点的左右子节点深度相差不超过1）思路：递归，这个题需要记住代码：/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.

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?

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.

Evaluate the value of an arithmetic expression in Reverse Polish Notation.

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line.

Sort a linked list in O(n log n) time using constant space complexity.

用插入排序实现对链表的排序

二叉树的前中后序遍历

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.

Find the contiguous subarray within an array (containing at least one number) which has the largest sum.

单链表原地翻转的问题

单链表翻转的第二个版本。

Given a string S and a string T, find the minimum window in S which will contain all the characters in T in complexity O(n).For example,S = “ADOBECODEBANC”T = “ABC”Minimum window is “BANC”.Note:If ther

Given numRows, generate the first numRows of Pascal’s triangle. For example, given numRows = 5, Return [ [1], [1,1], [1,2,1], [1,3,3,1], [1,4,6,4,1] ]

Given an index k, return the k th row of the Pascal’s triangle. For example, given k = 3, Return[1,3,3,1].

Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?

Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any