复兴之矢

【subset I】问题： Given a set of distinct integers, nums, return all possible subsets. Note: The solution set must not contain duplicate subsets. For example, If nums = [1,2,3], a

问题： 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. 分析： 注意 p==nullptr 和 !p的不同； 代

问题： Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,3,2]. 分析：

问题： Implement pow(x, n). 分析： 1、二分法：x^n = x^n/2 * x^n/2 ×*x^n%2。 代码： class Solution { public: double myPow(double x,int n){ //指数为负的情况： 倒数； if

问题： Implement int sqrt(int x). Compute and return the square root of x. 分析： 1、二分法。 代码： class solution{ public: int sqrt(int x){ if(x

【leetcode】 unique paths 动规解法

问题： 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

问题： Given two words (beginWord and endWord), and a dictionary's word list, find the length of shortest transformation sequence frombeginWord to endWord, such that: Only one let

题目： 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

题目： Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. 分析： 看字符串needle是否是haystack的一部分。用暴力破解法。 代码：

问题： 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 were inserted in order. You may assume no duplica