kelly

题目描述：Sort a linked list using insertion sort.代码实现；package leetcoder;class ListNode { int val; ListNode next; public ListNode head1; ListNode(int x) { val = x; next = null; }}publi

题目：Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0

题目描述 Given a number represented as an array of digits, plus one to the number.分析digits数组代表一个大整数，将这个大整数加1.如果末尾位上的数小于9，直接将该位加1.如果末尾位置上的数大于9，将该位置0，产生进位。public int[] plusOne(int[] digits) { for

题目描述Given a matrix of m x n elements (m rows, n columns), return all elements of the matrix in spiral order.For example,Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You sh

题目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?java实现public void rotate(int[][] matrix) { int row =

题目描述 Given an unsorted integer array, find the first missing positive integer. For example, Given[1,2,0]return3, and[3,4,-1,1]return2. Your algorithm should run in O(n) time and uses cons

题目描述 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 po

题目描述 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 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 array, you must do this in plac

复制无向图

题目描述 There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected to the following requirements: Each child must have at le

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

题目描述：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}, reor

题目描述：Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are+,-,*,/. Each operand may be an integer or another expression.Some examples: ["2", "1

题目描述：Given a binary tree, return the postorder traversal of its nodes' values.For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3return[3,2,1].Note: Recursive soluti

二叉树的前序遍历的递归实现：public static ArrayList preorderTraversal(TreeNode root) { if (root == null) return value; value.add(root.val); preorderTraversal(root.left); preorderTraversal(root.right);

题目描述：如何判断一个单链表是否有环？思路解析：如果定义两个指针，一个一次走两步，另一个一次走一步，那么经过若干步之后，两个指针必定在某一点相遇。class Solution {public: bool hasCycle(ListNode *head) { ListNode *fast = head; ListNode *slow = head

题目描述：Given a linked list, return the node where the cycle begins. If there is no cycle, returnnull.Follow up:Can you solve it without using extra space思路解析：首先我们看一张图;

题目描述: Given a string s and a dictionary of words dict, add spaces in s to construct a sentence where each word is a valid dictionary word. Return all such possible sentences. For example, given s =

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.解法一我们可以按如下步骤： 1.复制每一个节点 2.复制附

题目描述Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate word