Leetcode
文章平均质量分 66
Magic__Yang
在读研究生,研究方向,计算机视觉,三维重建,机器学习.
未来想在游戏产业发展,努力,努力,努力
展开
-
Pow(x,n)
Implement pow(x, n).原创 2014-11-08 22:12:08 · 555 阅读 · 0 评论 -
二叉树的常见遍历方法
先序遍历 中序遍历 后序遍历 深度优先 宽度youxi原创 2014-11-08 21:55:38 · 884 阅读 · 0 评论 -
几种排序算法的简介
选择排序(insert sort) 插入排序(insert sort) duipaixv原创 2014-07-15 15:35:20 · 632 阅读 · 0 评论 -
Remove Duplicates from Sorted List
题目: 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->3, return 1->2->3. 提议原创 2014-11-08 22:15:10 · 527 阅读 · 0 评论 -
Median of Two Sorted Arrays
题目: There are two sorted arrays A and B of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)). 题目大意:转载 2014-11-08 22:10:52 · 556 阅读 · 0 评论 -
Generate Parentheses
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: "((()))", "(()())", "(())()", "()(())", "()()原创 2014-11-08 22:19:30 · 691 阅读 · 0 评论 -
Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telephone buttons) is given below. Input:Digit st原创 2014-11-08 22:21:19 · 606 阅读 · 0 评论 -
Maximum Subarray
题目: Find the contiguous subarray within an array (containing at least one number) which has the largest sum. For example, given the array [−2,1,−3,4,−1,2,1,−5,4], the contiguous subarray [4,−1,原创 2014-11-08 22:06:43 · 585 阅读 · 0 评论 -
N-Queens
The n-queens puzzle is the problem of placing n queens on an n×n chessboard such that no two queens attack each other. Given an integer n, return all distinct solutions to the n-queens puzzle.原创 2014-11-08 22:16:39 · 534 阅读 · 0 评论