排序:
默认
按更新时间
按访问量

javascript

基础语法jqery的一些zencode http://docs.emmet.io/abbreviations/syntax/ 数据类型以及控制元素未定义的判断() if(typeof(sentiment)!=”undefined”){}布尔判断 小写的 true 和false强制字符串转...

2016-03-22 21:25:26

阅读数:503

评论数:0

Python的基础函数

python 开发文档镇楼。 https://docs.python.org/2/index.html关于代码python的合理布局(1)起始行 (2) 模块文档 (3)模块导入 (4)变量定义 (5)类定义 (6)函数定义 (7)主程序文档编码#encoding: utf-8 # ...

2016-03-06 15:55:36

阅读数:417

评论数:0

自然语言处理

好像有时候会用到自然语言处理。 包括一些概念性东西和知识整理。 知乎上面整理的自然语言入门的知识贴 http://www.zhihu.com/question/19895141 coursera上面有一个哥伦比亚 https://www.coursera.org/course/nlang...

2015-11-07 14:33:51

阅读数:1228

评论数:0

C++一些函数 备用

http://baike.baidu.com/link?url=eikMzuoUH9_OOD_Z4ov-JdcAdv2bMse_eWBLjRuL5IH9ggR-AgMng2SI7GiLHQuzQWiRmetaKECksoq-TLoX8a find_first_not_of http://blog...

2014-01-12 19:15:12

阅读数:1221

评论数:0

[编程题] 偶数大翻转

今天的计算机课上,老师给同学们出了一道题: 输入n个数,请将其中的偶数的二进制反转。 eg:输入1 6 5 其中6是偶数,二进制表示为110,反转后为011,代表3,所以最终输出1 3 5. 小贱君最近脑子不怎么好使,想了半天也没想出来如何做,最后他向你寻求帮助了,帮帮可怜的小贱君吧!输入...

2016-08-06 12:38:43

阅读数:603

评论数:0

【leetcode】36. Valid Sudoku

36. Valid SudokuDetermine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cell...

2016-07-30 16:43:49

阅读数:386

评论数:0

【leetcode】53. Maximum Subarray

53. Maximum Subarray Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the ...

2016-07-17 16:45:53

阅读数:271

评论数:0

【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 ...

2016-07-17 13:47:40

阅读数:206

评论数:0

【leetcode】110. Balanced Binary Tree

Given a binary tree, determine if it is height-balanced.For this problem, a height-balanced binary tree is defined as a binary tree in which the dept...

2016-07-16 13:46:43

阅读数:184

评论数:0

【leetcode】66. Plus One

Given a non-negative number represented as an array of digits, plus one to the number.The digits are stored such that the most significant digit is a...

2016-07-16 12:12:15

阅读数:237

评论数:0

【leetcode】46. Permutations

Given a collection of distinct numbers, return all possible permutations.For example, [1,2,3] have the following permutations: [ [1,2,3], ...

2016-07-15 11:33:48

阅读数:173

评论数:0

C++一些函数 备用 markdown

cppreference输入输出 重定向 freopen(“input.txt”, “r”, stdin); 整行输入string a; #include<iostream> getline(cin, a); 因为那个啥超时的原因,需要C语言 char a[100];inc...

2016-07-15 10:56:38

阅读数:578

评论数:0

【leetcode】62. Unique Paths

class Solution {private: int backtrack(int r,int c,int m,int n){ if(r==m-1&&c==n-1){ return 1; } if(r...

2016-07-15 10:45:46

阅读数:149

评论数:0

【leetcode】28. Implement strStr()

第一种,javascript原生态函数,108ms /** * @param {string} haystack * @param {string} needle * @return {number} */ var strStr = function(haystack, needle) {...

2016-07-15 10:39:57

阅读数:217

评论数:0

【leetcode】27. Remove Element

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you ...

2016-07-08 09:53:01

阅读数:225

评论数:0

【leetcode】26. Remove Duplicates from Sorted Array

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space fo...

2016-07-07 11:53:29

阅读数:194

评论数:0

【leetcode】25. Reverse Nodes in k-Group

Given a linked list, reverse the nodes of a linked list k at a time and return its modified list.If the number of nodes is not a multiple of k then l...

2016-07-06 15:29:15

阅读数:159

评论数:0

【leetcode】23. Merge k Sorted Lists

Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity./** * Definition for singly-linked list. * functi...

2016-07-06 13:50:43

阅读数:133

评论数:0

【leetcode】24. Swap Nodes in Pairs

Given a linked list, swap every two adjacent nodes and return its head.For example, Given1->2->3->4, you should return the list as 2->1-...

2016-07-05 19:40:28

阅读数:167

评论数:0

【leetcode】21. Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists./** * D...

2016-07-05 10:36:31

阅读数:152

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭