- 博客(5)
- 资源 (26)
- 问答 (1)
- 收藏
- 关注
原创 二叉树的面试题目总结
主要涉及:二叉树的遍历、路径和、翻转、镜像、子树、和链表转换1。二叉树的先序遍历 List<Integer> res=new ArrayList<Integer>(); public static List<Integer> preOrder(TreeNode root){ if(root==null) return res; res.add(root
2016-09-16 16:04:29 1117 2
原创 leetcode---64. Minimum Path Sum
Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of all numbers along its path.Note: You can only move either down or right at any
2016-09-04 15:00:28 898
原创 leetcode----63. Unique Paths II
Follow up for “Unique Paths”:Now consider if some obstacles are added to the grids. How many unique paths would there be?An obstacle and empty space is marked as 1 and 0 respectively in the grid.For ex
2016-09-04 14:42:06 549
原创 leetcode---62. Unique Paths
A robot is located at the top-left corner of a m x n grid (marked ‘Start’ in the diagram below).The robot can only move either down or right at any point in time. The robot is trying to reach the botto
2016-09-04 14:35:57 636
原创 排序
数组的快速排序 nlogn 空间复杂度为log(n) public static int partion(int [] a,int from,int to){ if(a==null) return -1; int base=a[from]; while(from<to){ while(from<to&&a[to]
2016-09-01 21:54:01 726
ACM程序设计
2016-11-16
Multi-View K-Means Clustering on Big Data
2016-04-06
图像可视化的综述+原文+译文
2015-10-18
如何进行机器学习算法的实验?
2015-10-30
TA创建的收藏夹 TA关注的收藏夹
TA关注的人