田航语

from collections import deque class Solution: def doubleBFS(start,end): if start == end: return 1 # 分别从起点和终点开始的两个队列 startQueue,endQueue = deque()...

/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this-&...

克隆图 中文English 克隆一张无向图. 无向图的每个节点包含一个 label 和一个列表 neighbors. 保证每个节点的 label 互不相同. 你的程序需要返回一个经过深度拷贝的新图. 新图和原图具有同样的结构, 并且对新图的任何改动不会对原图造成任何影响. Example 样例1 输入: {1,2,4#2,1,4#4,1,2} 输出: {1,2,4#2,1,4#4,1,2} 解...

Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000. Example 1: Input: “babad” Output: “bab” Note: “aba” is also a valid answer. Example ...

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 do this in place with constant memory.

Given a pattern and a string str, find if str follows the same pattern. Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in str.

Given an input string, reverse the string word by word. For example, Given s = "the sky is blue", return "blue is sky the". Update (2015-02-12): For C programmers: Try to solve it in-place in

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() --

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element

Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input ca

Implement strStr(). Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. class Solution { public: int strStr(string haystack, string need

Given a n x n matrix where each of the rows and columns are sorted in ascending order, find the kth smallest element in the matrix. Note that it is the kth smallest element in the sorted order, not

题目在这class NestedIterator { public: NestedIterator(vector<NestedInteger> &nestedList) { for(int i=nestedList.size()-1;i>=0;--i){ s.push(nestedList[i]); } } int nex

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r

2017年1月2日 https://leetcode.com/problems/find-the-difference/class Solution { public: char findTheDifference(string s, string t) { for(int i=1;i<s.size();i++) {

https://leetcode.com/problems/intersection-of-two-arrays-ii/妈蛋，我还是个弱鸡，这样的题目也不能解决，~~(>_<)~~，算了自己不正确的思路，就不写了 既然他们是有序的，当然在此之前是给她排序哈.sort(nums1.begin(),nums1.end()); sort(nums1.begin(),nums1.end());然后确定长度

https://leetcode.com/problems/linked-list-random-node//** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {

Given a linked list, determine if it has a cycle in it. /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next