2016年12月_谛听-

12月 11月 10月 09月 08月 07月 06月 05月 04月 03月 02月 01月

原创 leetcode---Implement Stack using Queues

Implement the following operations of a stack using queues.push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet

2016-12-26 21:05:38 269

原创 leetcode---Summary Ranges

Given a sorted integer array without duplicates, return the summary of its ranges.For example, given [0,1,2,4,5,7], return ["0->2","4->5","7"]. class Solution {public: string int2string(in

2016-12-25 00:00:00 246

原创 leetcode---Invert Binary Tree

Invert a binary tree. 4 / \ 2 7 / \ / \1 3 6 9to 4 / \ 7 2 / \ / \9 6 3 1Trivia:This problem was inspired by this original tweet by Max Howe

2016-12-23 23:38:20 262

原创 matlab---RBF

data = importdata('rbf.txt'); %输入文件，只有一列数据，共312个，前252个作为训练nTrain = 252; %训练数据个数nTest = 60; %测试数据个数n = 5; %用5个数据预测第6个%训练 252个i = 1;x =

2016-12-18 16:50:15 3432 4

原创谐波分析

1.txt中只有一列数据，共240个#include "iostream"#include "fstream"#include "math.h"#include "algorithm"#include "vector"using namespace std;#define pi 3.141592653struct V{ double a, b, I; int k;

2016-12-17 11:21:33 1350 1

原创 matlab---逐步回归

x = importdata('hg.txt'); %导入实际数据共有10列，前9列为x，最后一列为y%disp(x); %打印xy = x(:, end);%disp(y) %打印yx = x(:, 1:end-1);%disp(x) %打印xstepwise(x,y)接下来的步骤： http://www.360doc.com/content/

2016-12-17 10:51:13 13993 2

原创 sql---在查询语句中将float转换为int

select cast((f4+F5)/2 as int) from e where f4 - F5 -3

2016-12-11 17:12:09 11447

原创 leetcode---Maximal Square---动规

Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area.For example, given the following matrix:1 0 1 0 01 0 1 1 11 1 1 1 11 0 0 1 0

2016-12-06 21:29:22 257

原创 leetcode---Contains Duplicate III

Given an array of integers, find out whether there are two distinct indices i and j in the array such that the difference between nums[i] and nums[j] is at most t and the difference between i and

2016-12-05 17:09:55 235

原创 leetcode---Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j]and the difference between i and j is at most k.class

2016-12-03 23:24:01 279

原创 leetcdoe---Contains Duplicate

Given an array of integers, find if the array contains any duplicates. Your function should return true if any value appears at least twice in the array, and it should return false if every element is

2016-12-01 12:30:56 382

Rx_Net35_SP1

.Net 3.5 下使用 System.Threading.Tasks。安装后，在目录 C:\Program Files (x86)\Microsoft Reactive Extensions\Redist\DesktopV2 下找到 System.Threading.dll，添加引用即可

2019-03-13

简单的CNN示例代码,简单的CNN示例代码,

c++ 的简单的CNN示例代码。码。

2017-03-04

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人