weishenmetlc的博客

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Given a m  n matrix, if an element is 0, set its entire row and column to 0. Do it in place. Follow up: Did you use extra space?

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：There are N gas stations along a circular route, where the amount of gas at station i is gas[i]. You have a car with an unlimited

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：There are N children standing in a line. Each child is assigned a rating value. You are giving candies to these children subjected

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Given an array of integers, every element appears twice except for one. Find that single one. Note: Your algorithm should have a l

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Given an array of integers, every element appears three times except for one. Find that single one. Note: Your algorithm should ha

题目： 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: Given num

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their node

注：本题的解法思想及代码参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Reverse a linked list from position m to n. Do it in-place and in one-pass. For example: Given 1->2->3->4->5->nullptr, m = 2 and n

题目：Reverse a singly linked list.解题代码如下：//迭代版// reversed the whole linked list// 时间复杂度 O(n)，空间复杂度 O(1)class Solution {public: ListNode* reverseList(ListNode* head) { if (head

题目：Given a linked list and a value x, partition it such that all nodes less than x come before nodes greater than or equal to x. You should preserve the original relative order of the nodes in each o

题目：Given a sorted linked list, delete all duplicates such that each element appear only once. For example, Given 1->1->2, return 1->2. Given 1->1->2->3->3, return 1->2->3.解题代码版本一：//迭代版本//时间复杂度O(n)，

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Given a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list. Fo

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Given a list, rotate the list to the right by k places, where k is non-negative. For example: Given 1->2->3->4->5->nullptr and k =

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5,

题目：Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You

题目：Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. If the number of nodes is not a multiple of k then left-out nodes in the end should remain as it is

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目：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.

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目题目：Given a linked list, determine if it has a cycle in it. Follow up: Can you solve it without using extra space?解析1：设置一个快指针和一个慢指针，

题目：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?解析1：下面解题代码的思想及编写参考了网址https://github.com/soulmac

题目：Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.在解题之前，最好要先了解一下罗马数字组合原理罗马数字：罗马数字采用 7 个罗马字母作数字，即 I(1)，V(5)，X(10)，L(50)，C(100)，D(500)，M(100

题目：Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.下面解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目题目解析：从前往后扫描字符串，逐个字符的扫

题目：The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, … 1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2

题目：Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case.解析：anagram 表示由颠倒字母顺序而构成的单词。属于 anagram 的两个字符串虽然它们的字母顺序不同，但是将它们按字母排序后应该相等，否则这两个字符串就不属

题目：Given an absolute path for a file (Unix-style), simplify it. For example, path = “/home/”, => “/home” path = “/a/./b/../../c/”, => “/c” Corner Cases: • Did you consider the case where path = “/

题目：Given a string s consists of upper/lower-case alphabets and empty space characters ’ ‘, return the length of last word in the string. If the last word does not exist, return 0. Note: A word is defi

题目：Given a singly linked list L : L0−>L1−>...

−>Ln−1−>LnL_{0} -> L_{1} -> ...

-> L_{n - 1} -> L_{n} , reorder it to: L0−>Ln−>L1−>Ln−1−>L2−>Ln−2−>L_{0} -> L_{n} -> L_{1} -> L_{n -1} -> L_{2} -> L_{

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目题目：Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and s

题目：Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid. The brackets must close in the correct order, “()” and “()[]” are all valid bu

题目：Given a string containing just the characters ‘(’ and ‘)’, find the length of the longest valid (wellformed) parentheses substring. For “(()”, the longest valid parentheses substring is “()”, which

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目题目：Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases. For example, “A m

本题解法代码的思想及编写参考了网址https://github.com/soulmachine/leetcode#leetcode题解题目 题目：Implement atoi to convert a string to an integer. Hint: Carefully consider all possible input cases. If you want a challenge,

题目：Given two binary strings, return their sum (also a binary string). For example, a = “11” b = “1” Return “100”.解题代码如下：class Solution {public: string addBinary(string a, string b) {

题目：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”, “+”, “3”

注：本题的解法思想来自于https://github.com/soulmachine/leetcode#leetcode题解题目：Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate

注：本题的解法思想及参考的代码来自于https://github.com/soulmachine/leetcode#leetcode题解题目：Follow up for ”Remove Duplicates”: What if duplicates are allowed at most twice? For example, Given sorted array A = [1,1,1,2,2,3

注：本题的解法思想及参考的代码来自于https://github.com/soulmachine/leetcode#leetcode题解题目： Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). Y

注：本题的解法思想及参考的代码来自于https://github.com/soulmachine/leetcode#leetcode题解题目：Follow up for ”Search in Rotated Sorted Array”: What if duplicates are allowed? Would this affect the run-time complexity? How an

注：本题的解法思想及参考的代码来自于https://github.com/soulmachine/leetcode#leetcode题解题目：There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time

注：本题的解法思想及参考的代码来自于https://github.com/soulmachine/leetcode#leetcode题解题目： Given an unsorted array of integers, find the length of the longest consecutive elements sequence. For example, Given [100, 4,

注：本题的解法思想及参考的代码来自于https://github.com/soulmachine/leetcode#leetcode题解题目：Given an array of integers, find two numbers such that they add up to a specific target number. The function twoSum should return