摘要:
题目描述: Suppose an array sorted in ascending order 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). 阅读全文
摘要:
题目描述: Given an array of integers, every element appears three times except for one, which appears exactly once. Find that single one. 解题思路: 这题还是用136也就 阅读全文
摘要:
题目描述: Given a 2D board containing 'X' and 'O' (the letter O), capture all regions surrounded by 'X'. A region is captured by flipping all 'O's into 'X 阅读全文
摘要:
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 whic 阅读全文
摘要:
题目描述: Given a triangle, find the minimum path sum from top to bottom. Each step you may move to adjacent numbers on the row below. For example, given 阅读全文
摘要:
题目描述: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree 阅读全文
摘要:
题目描述: Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary 阅读全文
摘要:
题目描述: Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree [1,null,2,3], return [1,3,2]. Note: Recur 阅读全文