d_benhua的博客

344.Reverse StringWrite a function that takes a string as input and returns the string reversed.Example:Given s = "hello", return "olleh".解题方法1：定义一个指针数组，通过赋值进行反转操作执行时间 8mschar* reverseSt...

160. Intersection of Two Linked ListsWrite a program to find the node at which the intersection of two singly linked lists begins.For example, the following two linked lists:begin to intersect...

83. Remove Duplicates from Sorted ListGiven a sorted linked list, delete all duplicates such that each element appear onlyonce.Example 1:Input: 1->1->2Output: 1->2Example 2:In...

86. Partition ListGiven a linked list and a valuex, partition it such that all nodes less thanxcome before nodes greater than or equal tox.You should preserve the original relative order of t...

203. Remove Linked List ElementsRemove all elements from a linked list of integers that have valueval.Example:Input: 1->2->6->3->4->5->6, val = 6Output: 1->2->3->4...

707. Design Linked ListDesign yourimplementation of the linked list. You can choose to use the singly linked list or the doubly linked list. A node in a singlylinked list should have two attribute...

27.Remove ElementGiven an arraynumsand a valueval, remove all instances of that valuein-placeand return the new length.Do not allocate extra space for another array, you must do this bymodif...

c标准库：https://www.runoob.com/cprogramming/c-standard-library-assert-h.htmlpow()函数： 计算a的x次方并返回给result用法：#include<math.h>result = pow(a,x);Qusetion：得出一个整数x的digit(位数)。Example：x = ...

2. Add Two NumbersYou 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 ...

82. Remove Duplicates from Sorted List IIGiven a sorted linked list, delete all nodes that have duplicate numbers, leaving only distinct numbers from the original list.Example 1:Input: 1->2-&...

237. Delete Node in a Linked ListWrite a function to delete a node (except the tail) in a singly linked list, given only access to that node.Given linked list --head =[4,5,1,9], which looks like...

876. Middle of the Linked ListGiven a non-empty, singlylinked list with head node head, returnamiddle node of linked list.If there are two middle nodes, return the second middle node.Example ...

92. Reverse Linked List IIReverse a linked list from positionmton. Do it in one-pass.Note:1 ≤m≤n≤ length of list.Example:Input: 1->2->3->4->5->NULL, m = 2, n = 4Output...

147. Insertion Sort ListSort a linked list using insertion sort.A graphical example of insertion sort. The partial sorted list (black) initially contains only the first element in the list.With ...

148. Sort ListSort a linked list in O(n log n) time using constant space complexity.Example 1:Input: 4->2->1->3Output: 1->2->3->4Example 2:Input: -1->5->3->4->...

1019. Next Greater Node In Linked ListWe are given a linked list withheadas the first node.Let's number thenodes in the list: node_1, node_2, node_3, ... etc.Each node may have a next larger ...

143. Reorder ListGiven a singly linked listL:L0→L1→…→Ln-1→Ln,reorder it to:L0→Ln→L1→Ln-1→L2→Ln-2→…You maynotmodify the values in the list's nodes, only nodes itself may be changed.Example...

141. Linked List CycleGiven a linked list, determine if it has a cycle in it.To represent a cycle in the given linked list, we use an integerposwhich represents the position (0-indexed)in the l...

206. Reverse Linked ListReverse a singly linked list.Example:Input: 1->2->3->4->5->NULLOutput: 5->4->3->2->1->NULLFollow up:A linked list can be reversed eit...

387.First Unique Character in a StringGiven a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples:s = "leetcode"return 0.s = ...

Odd Even Linked ListGiven a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.You shou...

26. Remove Duplicates from Sorted ArrayGiven a sorted arraynums, remove the duplicatesin-placesuch that each element appear onlyonceand return the new length.Do not allocate extra space for a...

61. Rotate ListGiven a linkedlist, rotate the list to the right bykplaces, wherekis non-negative.Example 1:Input: 1->2->3->4->5->NULL, k = 2Output: 4->5->1->2-&gt...

724. Find Pivot IndexGiven an array of integersnums, write a method that returns the "pivot" index of this array.We define the pivot index as the index where the sum of the numbers to the left of...

747. Largest Number At Least Twice of OthersIn a given integer arraynums, there is always exactly one largest element.Find whether the largest element in the array is at least twice as much as ev...

66. Plus OneGiven anon-emptyarray of digitsrepresenting a non-negative integer, plus one to the integer.The digits are stored such that the most significant digit is at the head of the list, an...

21. Merge Two Sorted ListsMerge 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.Example:Input: 1->2-&gt...

234. Palindrome Linked ListGiven a singly linked list, determine if it is a palindrome.Example 1:Input: 1->2Output: falseExample 2:Input: 1->2->2->1Output: trueFollow up:C...

118. Pascal's TriangleGiven a non-negative integernumRows, generate the firstnumRowsof Pascal's triangle.In Pascal's triangle, each number is the sum of the two numbers directly above it.Exa...

119. Pascal's Triangle IIGiven a non-negativeindexkwherek≤33, return thekthindex row of the Pascal's triangle.Note that the row index starts from0.In Pascal's triangle, each number is ...

一：用伪代码简单描述自己的解题思路（在纸上或是leetcode的笔记本上）二：对特殊情况进行考虑，并进行必要的解释三：代码！！！一定要进行“注释”，只有注释才知道自己当时是怎么考虑的！！！四：测试不通过的用例贴到自己的代码里，正确的期望输出也要一并贴上五：修改代码时不要删掉不需要的代码应该注释掉（因为这可以反应出你考虑的欠缺），等到真的确定没价值了再删六：如果引用或者借鉴...

7.Reverse IntegerGiven a 32-bit signed integer, reverse digits of an integer.Example 1:Input: 123Output: 321Example 2:Input: -123Output: -321Example 3:Input: 120Output: 21Note...

344.Reverse StringWrite a function that reverses a string. The input string is given as an array of characterschar[].Do not allocate extra space for another array, you must do this bymodifying t...

142. Linked List Cycle IIGiven a linked list, return the node where the cycle begins. If there is no cycle, return null.To represent a cycle in the given linked list, we use an integer pos which rep...

19. Remove Nth Node From End of ListGiven a linked list, remove then-th node from the end of list and return its head.Example:Given linked list: 1->2->3->4->5, and n = 2.After re...

24. Swap Nodes in PairsGiven alinked list, swap every two adjacent nodes and return its head.You maynotmodify the values in the list's nodes, only nodes itself may be changed.Example:Given...