摘要： Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: " 阅读全文

摘要： Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in or 阅读全文

摘要： 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-> 阅读全文

摘要： Given an array of integers, every element appears three times except for one. Find that single one. 结题报告： 方法一： 使用map记录每个数字出现的次数，找到出现次数不为3的数。 class Sol 阅读全文

摘要： Given a binary tree struct TreeLinkNode { TreeLinkNode *left; TreeLinkNode *right; TreeLinkNode *next; } Populate each next pointer to point to its ne 阅读全文

摘要： Given an array where elements are sorted in ascending order, convert it to a height balanced BST. 解题思路： 分开考虑n==0 n==1 n==2的情况，可将原来20ms时间提升至16ms #inclu 阅读全文

摘要： Given a linked list, determine if it has a cycle in it. 解题思路： #include<windows.h> #include<iostream> using namespace std; struct ListNode { int val; L 阅读全文

摘要： Given a binary search tree (BST), find the lowest common ancestor (LCA) of two given nodes in the BST. According to the definition of LCA on Wikipedia 阅读全文

摘要： Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming weight). For example, the 32-bit 阅读全文

摘要： Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 解题思路： 屏幕剪辑的捕获时间: 2016/3/4 22:52 从左到右，两两进行比 阅读全文