Miss.Zhou

分类

###基本算法(～ o ～)Y(1) .net(1) 2014多校联合(2) acm(12) arcgis(1) bfs(1) c#(1) c++(1) CF(2) codeforces(5) css(1) dp(27) git使用(1) hdu(27) java(1) javascript(4) LeetCode(47) leetcode (1) lightoj(1) oi(1) php(12) poj(13) poj 搜索算法 acm(1) poj 算法线段树懒惰标记(1) python(2) RMQ(1) socket(1) splay(1) tarjan(3) trie(3) vmware(1) web开发(1) xml(1) —dp(9) —STL(2) ———哈希表(2) ———网络流(1) —二分(2) —图论(7) —字符串(4) —思维题(1) —搜索(7) —数据结构(5) —数论(9) —贪心(4) 三分(1) 二分图(3) 前端(1) 动态规划(1) 匈牙利算法(1) 博弈(1) 压缩(1) 双连通分量(1) 图论(4) 多校(2) 并查集(1) 并查集 poj(1) 并查集几何 hdu(1) 并查集算法(2) 广搜(2) 思维题(1) 拓扑排序(1) 搜素(1) 搜索(1) 操作系统(2) 数据结构(1) 数论算法(3) 最佳二分匹配(1) 最大二分匹配(2) 最小树形图(1) 未归档(397) 杭电(7) 树型dp(2) 模拟(1) 欧拉回路(1) 正则表达式(1) 深搜(1) 深搜 hdu 算法(1) 矩阵(1) 算法(10) 算法并查集(1) 线段树(6) 编程(1) 网络流(4) 计算机基础(4) 设计模式(19) 贪心(1) 随笔(1) 题解(8) 验证码(1)

/ 注册

全部文章（共733篇）

leetcode 43. Multiply Strings【大数乘法】

https://leetcode.com/problems/multiply-strings/description/ Given two non-negative integers num1 and num2 represented as strings, return the product ...

leetcode 大数乘法

2018-10-18

0 594

LeetCode40. Combination Sum II

https://leetcode.com/problems/combination-sum-ii/description/ Given a collection of candidate numbers (candidates) and a target number (target), find...

leetcode

2018-10-17

0 743

leetcode39. Combination Sum【回溯】

https://leetcode.com/problems/combination-sum/description/ Given a set of candidate numbers (candidates) (without duplicates) and a target number (ta...

leetcode 回溯

2018-10-16

0 518

LeetCode 36. Valid Sudoku【九宫格判断合法】

Determine if a 9x9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: Each row must contain the di...

2018-10-15

0 690

leetcode33. Search in Rotated Sorted Array【旋转数组找指定值二分】

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., [0,1,2,4,5,6,7] might become [4,5,6,7,0,1,2]). ...

leetcode 二分

2018-10-12

0 707

leetcode 29. Divide Two Integers【二进制】不用除法做整除

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator. Return the quotient after divid...

2018-10-10

0 564

leetcode24. Swap Nodes in Pairs【Python刷题】链表交换相邻位置

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

2018-10-08

0 504

leetcode 22. Generate Parentheses

22. Generate Parentheses DescriptionHintsSubmissionsDiscussSolution Pick One Given n pairs of parentheses, write a function to generate all com...

leetcode

2018-09-28

0 810

leetcode 19. Remove Nth Node From End of List【Python刷题】

Given a linked list, remove the n-th node from the end of list and return its head. Example: Given linked list: 1->2->3->4->5, and n = ...

leetcode

2018-09-27

0 531

设计模式——职责链模式

使多个对象都有机会处理请求，从而避免请求的发送者和接收者之间的耦合关系。将这个对象连成一条链，并沿着这条链传递请求，直到有一个对象处理他为止。 namespace 职责链模式 { abstract class Handler { protected Handler...

设计模式

2018-09-26

0 506