Fork me on GitHub
上一页 1 ··· 16 17 18 19 20 21 22 23 24 ··· 37 下一页
摘要: 转载自:http://blog.sina.com.cn/s/blog_90444ed201016iq6.html http://blog.csdn.net/zb1165048017/article/details/52785177 前言 最近要看一些论文做一下笔记,所以准备使用一下比较流行的Texl 阅读全文
posted @ 2017-06-09 15:08 hellowOOOrld 阅读(46462) 评论(0) 推荐(9) 编辑
摘要: Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1. Examples: Note: You may assume the 阅读全文
posted @ 2017-06-08 23:18 hellowOOOrld 阅读(185) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific target number. The function 阅读全文
posted @ 2017-06-07 20:35 hellowOOOrld 阅读(317) 评论(0) 推荐(0) 编辑
摘要: 转载自: http://blog.csdn.net/dengjianqiang2011/article/details/8753807 MATLAB矩阵操作大全 一、矩阵的表示在MATLAB中创建矩阵有以下规则:a、矩阵元素必须在”[ ]”内;b、矩阵的同行元素之间用空格(或”,”)隔开;c、矩阵的 阅读全文
posted @ 2017-06-07 14:47 hellowOOOrld 阅读(85537) 评论(0) 推荐(1) 编辑
摘要: 转载自:增广拉格朗日乘子法(Augmented Lagrange Method) 增广拉格朗日乘子法的作用是用来解决等式约束下的优化问题, 假定需要求解的问题如下: minimize f(X) s.t.: h(X)=0 其中,f:Rn->R; h:Rn->Rm 朴素拉格朗日乘子法的解决方案是: L( 阅读全文
posted @ 2017-06-07 10:57 hellowOOOrld 阅读(30305) 评论(0) 推荐(0) 编辑
摘要: Given a set of candidate numbers (C) (without duplicates) and a target number (T), find all unique combinations in C where the candidate numbers sums 阅读全文
posted @ 2017-06-06 22:57 hellowOOOrld 阅读(188) 评论(0) 推荐(0) 编辑
摘要: Given a digit string, return all possible letter combinations that the number could represent. A mapping of digit to letters (just like on the telepho 阅读全文
posted @ 2017-06-06 20:52 hellowOOOrld 阅读(133) 评论(0) 推荐(0) 编辑
摘要: Follow up for N-Queens problem. Now, instead outputting board configurations, return the total number of distinct solutions. 思路: 典型8皇后,回溯法,验证是否能放皇后位置, 阅读全文
posted @ 2017-06-05 13:45 hellowOOOrld 阅读(133) 评论(0) 推荐(0) 编辑
摘要: 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 阅读全文
posted @ 2017-06-05 10:59 hellowOOOrld 阅读(151) 评论(0) 推荐(0) 编辑
摘要: Given an array of integers sorted in ascending order, find the starting and ending position of a given target value. Your algorithm's runtime complexi 阅读全文
posted @ 2017-06-04 18:59 hellowOOOrld 阅读(114) 评论(0) 推荐(0) 编辑
上一页 1 ··· 16 17 18 19 20 21 22 23 24 ··· 37 下一页