上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 46 下一页
  2017年8月19日
摘要: Basis(基础): MSE(Mean Square Error 均方误差),LMS(LeastMean Square 最小均方),LSM(Least Square Methods 最小二乘法),MLE(MaximumLikelihood Estimation最大似然估计),QP(Quadratic 阅读全文
posted @ 2017-08-19 16:25 Beserious 阅读(298) 评论(0) 推荐(0) 编辑
  2017年8月18日
摘要: Design a data structure that supports the following two operations: search(word) can search a literal word or a regular expression string containing o 阅读全文
posted @ 2017-08-18 15:41 Beserious 阅读(310) 评论(0) 推荐(0) 编辑
摘要: Given two arrays, write a function to compute their intersection. Example:Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2]. Note: Each element i 阅读全文
posted @ 2017-08-18 08:57 Beserious 阅读(150) 评论(0) 推荐(0) 编辑
  2017年8月17日
摘要: You are given an integer array sorted in ascending order (may contain duplicates), you need to split them into several subsequences, where each subseq 阅读全文
posted @ 2017-08-17 21:56 Beserious 阅读(1347) 评论(0) 推荐(0) 编辑
  2017年8月16日
摘要: Given a sorted array, two integers k and x, find the k closest elements to x in the array. The result should also be sorted in ascending order. If the 阅读全文
posted @ 2017-08-16 18:24 Beserious 阅读(199) 评论(0) 推荐(0) 编辑
摘要: Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the or 阅读全文
posted @ 2017-08-16 18:11 Beserious 阅读(141) 评论(0) 推荐(0) 编辑
  2017年8月15日
摘要: Given a list of non negative integers, arrange them such that they form the largest number. For example, given [3, 30, 34, 5, 9], the largest formed n 阅读全文
posted @ 2017-08-15 17:35 Beserious 阅读(146) 评论(0) 推荐(0) 编辑
  2017年8月14日
摘要: Start from integer 1, remove any integer that contains 9 such as 9, 19, 29... So now, you will have a new integer sequence: 1, 2, 3, 4, 5, 6, 7, 8, 10 阅读全文
posted @ 2017-08-14 09:54 Beserious 阅读(243) 评论(0) 推荐(0) 编辑
  2017年8月11日
摘要: Find the length of the longest substring T of a given string (consists of lowercase letters only) such that every character in T appears no less than  阅读全文
posted @ 2017-08-11 16:26 Beserious 阅读(128) 评论(0) 推荐(0) 编辑
  2017年8月10日
摘要: Given an array of integers, 1 ≤ a[i] ≤ n (n = size of array), some elements appear twice and others appear once. Find all the elements that appear twi 阅读全文
posted @ 2017-08-10 22:11 Beserious 阅读(165) 评论(0) 推荐(0) 编辑
上一页 1 ··· 12 13 14 15 16 17 18 19 20 ··· 46 下一页