hjqmf125118的博客

问题：You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and r

问题：定义超级和函数F如下：F(0, n) = n，对于所有的正整数n..F(k, n) = F(k – 1, 1) + F(k – 1, 2) + … + F(k – 1, n)，对于所有的正整数k和n. 请实现下面Solution类中计算F(k, n)的函数（1   例1：F(1, 3) = 6 例2：F(2, 3) = 10 例3：F(10,

问题：k-SPANNING TREE问题是这样的：输入：无向图G=(V, E) 输出：G的一个生成树，其中所有的节点度数都不超过k——如果该树存在。 请证明对任意k>=2： (a)k-生成树问题是一个搜索问题。 (b)k-生成树问题是NP-完全的。（提示：由k=2开始，考虑该问题与Rudrata路径问题的关联。）答：(a) k-生成树问题能够

问题描述：Sort a linked list using insertion sort.分析：链表插入排序需要建立一个新的链表，按序遍历，让新链表中的合适节点指向新的节点代码：class Solution {public:    ListNode* insertionSortList(ListNode* head) {        ListNode* new_head

问题：Given a non-empty string s and a dictionary wordDict containing a list of non-empty words, determine if s can be segmented into a space-separated sequence of one or more dictionary words. You

问题：Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].Solve it without division a

问题：Given an array of numbers nums, in which exactly two elements appear only once and all the other elements appear exactly twice. Find the two elements that appear only once.For example:

问题：N个会议要同时举行，参会人数分别为A[0], A[1], ..., A[N-1]. 现有M个会议室，会议室可容纳人数分别为B[0], B[1], ..., B[M-1]. 当A[i] 1  请为下面的Solution类实现解决上述问题的函数assignConferenceRoom. 函数参数A和B的意义如上，返回值为最多可安排的会议数. class Solutio

问题：两个二叉树结构相同，且对应结点的值相同，我们称这两个二叉树等价. 例如：以下两个二叉树等价        1           1       /  \         /  \      2   3       2   3而以下两个则不等价        1           1       /  \         /  \      2  

问题描述：Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree and sum = 22, 5

问题描述：Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).For example:Given binary tree [3,9,20,null,null,15,7], 3

问题：Given a sequence of n integers a1, a2, ..., an, a 132 pattern is a subsequence ai, aj, ak such that i j kand ai < ak < aj. Design an algorithm that takes a list of n numbers as

问题描述：Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.分析：需要以每一个字母开始去遍历寻找与随后的字母是否构成回文：1、构成回文，则判断长度是否比之前的会问长度更长：1）若比之前的回文长度更长，

问题：The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)P A H NA P

问题：Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.k is a positive integer and is less than or equal to the length of the linked list. If the number

问题描述：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 entire

问题描述：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.De

问题：Given a collection of intervals, merge all overlapping intervals.For example,Given [1,3],[2,6],[8,10],[15,18],return [1,6],[8,10],[15,18].Subscribe to see which companies asked

问题：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 input would have

问题：对于一个01矩阵A，求其中有多少片连成一片的1. 每个1可以和上下左右的1相连. 请为下面的Solution类实现解决这一问题的函数countConnectedOnes，函数参数A为给出的01矩阵，A的行数和列数均不大于1000. 函数的返回值是问题的答案. 例1：A=100010001答案为3. 例2：A=1101010111