LeetCode

题目：28. Implement strStr() # Implement strStr().

题目：257. Binary Tree Paths # Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / 2 3 5 All root-to-leaf paths are: [“1->2->5”, “1->3”]

题目： # 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 defined as a character sequence consists of non-space characters only. For example, Given s = “Hello World”, return 5.

题目：Reverse Words in a String # Given an input string s, reverse the string word by word. For example, given s = “the sky is blue”, return “blue is sky the”.

本文主要包括 leetCode 题集里的两个题目，Two Sum1 和 Two Sum2 题目1： 1. Two Sum 1 # Given an array of integers, find two numbers such that they add up to a specific target number.

题目：Intersection of Two Linked lists # Write a program to find the node at which the intersection of two singly linked lists begins.

题目： # Find the contiguous subarray within an array (containing at least one number) which has the largest product. For example, given the array [2,3,-2,4], the contiguous subarray [2,3] has the largest product = 6.