# 8月 2018

445. Add Two Numbers II You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first and ea… 阅读更多 »Add Two Numbers II-LeetCode#445

## Middle of the Linked List-LeetCode#876

876. Middle of the Linked List Given a non-empty, singly linked list with head node head, return a middle node of linked list. If there are two middle… 阅读更多 »Middle of the Linked List-LeetCode#876

234. Palindrome Linked List Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false Example 2: Input: 1-&… 阅读更多 »Palindrome Linked List-LeetCode#234

## Search Insert Position-LeetCode#35

35. Search Insert Position Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would b… 阅读更多 »Search Insert Position-LeetCode#35

## Search a 2D Matrix II-LeetCode#240

240. Search a 2D Matrix II Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties: Intege… 阅读更多 »Search a 2D Matrix II-LeetCode#240

## K-th Smallest Prime Fraction-LeetCode#786

786. K-th Smallest Prime Fraction A sorted list A contains 1, plus some number of primes.  Then, for every p < q in the list, we consider the fract… 阅读更多 »K-th Smallest Prime Fraction-LeetCode#786

## Binary Tree Inorder Traversal-LeetCode#94

94. Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes’ values. Example: Input: [1,null,2,3] 1 \ 2 / 3… 阅读更多 »Binary Tree Inorder Traversal-LeetCode#94