2017年11月_谛听-

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

原创 leetcode---roman-to-integer---字符串

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.class Solution {public: int romanToInt(string s) { int n = s.length();

2017-11-30 23:46:39 212

原创 leetcode---implement-strstr---字符串

Implement strStr(). Returns a pointer to the first occurrence of needle in haystack, or null if needle is not part of haystack.class Solution {public: void makeNext(char *p, int *next) {

2017-11-23 20:11:55 219

原创 leetcode---multiply-strings---字符串

Given two numbers represented as strings, return multiplication of the numbers as a string. Note: The numbers can be arbitrarily large and are non-negative.class Solution {public: string multiply

2017-11-22 19:20:24 210

原创 leetcode---wildcard-matching---字符串，dp

Implement wildcard pattern matching with support for’?’and’*’. ‘?’ Matches any single character. ‘*’ Matches any sequence of characters (including the empty sequence).The matching should cover the en

2017-11-21 18:22:24 276

原创 leetcode---regular-expression-matching---字符串

Implement regular expression matching with support for’.’and’*’. ‘.’ Matches any single character. ‘*’ Matches zero or more of the preceding element.The matching should cover the entire input str...

2017-11-20 19:56:59 219

转载判断两线段相交，并求交点

原文 http://blog.csdn.net/rickliuxiao/article/details/6259322#include "math.h"#include "stdio.h"double E = 0.0001;struct Point { double x, y; }; double min(double x1, double x2){ retu

2017-11-20 10:55:17 3074

转载常用汇编指令

常用汇编指令一、数据传输指令　　它们在存贮器和寄存器、寄存器和输入输出端口之间传送数据. 　　1. 通用数据传送指令. 　　　　MOV　　传送字或字节. 　　　　MOVSX　先符号扩展,再传送. 　　　　MOVZX　先零扩展,再传送. 　　　　PUSH　　把字压入堆栈. 　　　　POP　　把字弹出堆栈. 　　　　PUSHA　把AX,CX,DX,BX,SP,BP,SI,DI依次压

2017-11-19 21:34:42 383

原创 c-->汇编

课程链接 https://www.ichunqiu.com/course/50571获取函数地址#include "windows.h"#include "stdio.h"void main(){ HINSTANCE LibHandle = LoadLibrary("Kernel32.dll"); printf("Kernel32.dll address = 0x%x \n",

2017-11-19 21:23:28 364

原创 C#---保留固定小数点后面位数

Math.Round(x, 5); // x四舍五入后保留5位小数

2017-11-16 11:42:57 1001

原创 leetcode---add-binary---字符串

Given two binary strings, return their sum (also a binary string). For example, a =”11” b =”1” Return”100”.class Solution {public: int atoi(char c) { return c - '0'; } string

2017-11-14 18:30:49 188

原创 leetcode---anagrams---字符串

Given an array of strings, return all groups of strings that are anagrams. Note: All inputs will be in lower-case.class Solution {public: vector<string> anagrams(vector<string> &strs) {

2017-11-14 18:11:24 202

原创 leetcode---length-of-last-word---字符串

Given a string s consists of upper/lower-case alphabets and empty space characters’ ‘, return the length of last word in the string. If the last word does not exist, return 0. Note: A word is defined

2017-11-14 18:10:30 182

原创 leetcode---palindrome-partitioning---dp, dfs

Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. For example, given s =”aab”, Return [ [“aa”,”b”],

2017-11-13 18:07:19 207

原创 leetcode---count-and-say---字符串

The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, … 1is read off as”one 1”or11. 11is read off as”two 1s”or21. 21is read off as”one 2, thenone 1”o

2017-11-06 19:14:58 209

原创 leetcode---longest-palindromic-substring---字符串

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.class Solution {public:

2017-11-05 19:40:45 223

原创 leetcode---longest-substring-without-repeating-characters---字符串

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “

2017-11-05 18:36:26 175

原创 leetcode---valid-parentheses---栈

Given a string containing just the characters’(‘,’)’,’{‘,’}’,’[‘and’]’, determine if the input string is valid. The brackets must close in the correct order,”()”and”()[]{}”are all valid but”(]”and”([)

2017-11-03 19:04:27 176

原创 leetcode---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)).class Solution {public: double fi

2017-11-01 19:37:04 260

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关注的人