SharonMoMo
码龄11年
关注
提问 私信
  • 博客:63,879
    63,879
    总访问量
  • 109
    原创
  • 1,834,418
    排名
  • 2
    粉丝
  • 0
    铁粉

个人简介:Every thing will be okay in the end....

IP属地以运营商信息为准,境内显示到省(区、市),境外显示到国家(地区)
IP 属地:美国
  • 加入CSDN时间: 2013-09-18
博客简介:

MoM

博客描述:
I have to believe myself
查看详细资料
个人成就
  • 获得1次点赞
  • 内容获得2次评论
  • 获得5次收藏
创作历程
  • 1篇
    2016年
  • 111篇
    2015年
成就勋章
TA的专栏
  • cc-6th
    46篇
  • [面试总结-电面]
    1篇
  • LintCode
    7篇
  • LeetCode
    57篇
创作活动更多

仓颉编程语言体验有奖征文

仓颉编程语言官网已上线,提供版本下载、在线运行、文档体验等功能。为鼓励更多开发者探索仓颉编程语言,现诚邀各位开发者通过官网在线体验/下载使用,参与仓颉体验有奖征文活动。

368人参与 去创作
  • 最近
  • 文章
  • 代码仓
  • 资源
  • 问答
  • 帖子
  • 视频
  • 课程
  • 关注/订阅/互动
  • 收藏
搜TA的内容
搜索 取消

[LeetCode325] Maximum Size Subarray Sum Equals k

Given an array nums and a target value k, find the maximum length of a subarray that sums to k. If there isn't one, return 0 instead.Example 1:Given nums = [1, -1, 5, -2, 3], k = 3,return 4. (because
原创
发布博客 2016.01.08 ·
1995 阅读 ·
0 点赞 ·
0 评论 ·
1 收藏

[LeetCode317]Shortest Distance from All Buildings

You want to build a house on an empty land which reaches all buildings in the shortest amount of distance. You are given a 2D grid of values 0, 1 or 2, where:Each 0 marks an empty land which you can pa
原创
发布博客 2015.12.17 ·
2491 阅读 ·
0 点赞 ·
0 评论 ·
1 收藏

[LeetCode315] Count of Smaller Numbers After Self

我靠!弄了一个小时!class node{public: int height, size, val; node *left, *right; node(int val){ this->val = val; this->height = 1; this->size = 1; this->left = this-
原创
发布博客 2015.12.07 ·
789 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode314]Binary Tree Vertical Order Traversal

Given a binary tree, return the vertical order traversal of its nodes' values. (ie, from top to bottom, column by column).If two nodes are in the same row and column, the order should be from left to r
原创
发布博客 2015.12.07 ·
1729 阅读 ·
0 点赞 ·
1 评论 ·
0 收藏

[LeetCode222]Count Complete Tree Nodes

Given a complete binary tree, count the number of nodes.Definition of a complete binary tree from Wikipedia:In a complete binary tree every level, except possibly the last, is completely filled, and a
原创
发布博客 2015.12.04 ·
355 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode212] Word Search II

HARDGiven a 2D board and a list of words from the dictionary, find all words in the board.Each word must be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those hori
原创
发布博客 2015.12.04 ·
460 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode202]Happy Number

Write an algorithm to determine if a number is "happy".A happy number is a number defined by the following process: Starting with any positive integer, replace the number by the sum of the squares of i
原创
发布博客 2015.12.03 ·
415 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode187]Repeated DNA Sequences

All DNA is composed of a series of nucleotides abbreviated as A, C, G, and T, for example: "ACGAATTCCG". When studying DNA, it is sometimes useful to identify repeated sequences within the DNA.Write a
原创
发布博客 2015.12.02 ·
297 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode164]Maximum Gap

HARDGiven an unsorted array, find the maximum difference between the successive elements in its sorted form.Try to solve it in linear time/space.Return 0 if the array contains less than 2 elements.You
原创
发布博客 2015.11.30 ·
407 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode311]Sparse Matrix Multiplication

Given two sparse matrices A and B, return the result of AB.You may assume that A's column number is equal to B's row number.Example: A = [ [ 1, 0, 0], [-1, 0, 3] ] B = [ [ 7
原创
发布博客 2015.11.29 ·
2265 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode308]Range Sum Query 2D - Mutable

Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).Range Sum Query 2DThe above rectangle (wit
原创
发布博客 2015.11.29 ·
4505 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode305]Number of Islands II

Hard..A 2d grid map of m rows and n columns is initially filled with water. We may perform an addLand operation which turns the water at position (row, col) into a land. Given a list of positions to op
原创
发布博客 2015.11.29 ·
863 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode302]Smallest Rectangle Enclosing Black Pixels

Hard ..An image is represented by a binary matrix with 0 as a white pixel and 1 as a black pixel. The black pixels are connected, i.e., there is only one black region. Pixels are connected horizontally
原创
发布博客 2015.11.29 ·
784 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode298]Binary Tree Longest Consecutive Sequence

Given a binary tree, find the length of the longest consecutive sequence path.The path refers to any sequence of nodes from some starting node to any node in the tree along the parent-child connections
原创
发布博客 2015.11.29 ·
622 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode296]Best Meeting Point

A group of two or more people wants to meet and minimize the total travel distance. You are given a 2D grid of values 0 or 1, where each 1 marks the home of someone in the group. The distance is calcul
原创
发布博客 2015.11.29 ·
460 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode294]Flip Game II

You are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take turns to flip two consecutive "++" into "--". The gam
原创
发布博客 2015.11.29 ·
571 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode293] Flip Game

EasyYou are playing the following Flip Game with your friend: Given a string that contains only these two characters: + and -, you and your friend take turns to flip two consecutive "++" into "--". The
原创
发布博客 2015.11.29 ·
993 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode291]Word Pattern II

Given a pattern and a string str, find if str follows the same pattern.Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty substring in str.Exampl
原创
发布博客 2015.11.29 ·
510 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode288]Unique Word Abbreviation

An abbreviation of a word follows the form <first letter><number><last letter>. Below are some examples of word abbreviations:a) it --> it (no abbreviation) 1b) d|o|g
原创
发布博客 2015.11.26 ·
595 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏

[LeetCode286]Walls and Gates

You are given a m x n 2D grid initialized with these three possible values.1.-1 - A wall or an obstacle.2.0 - A gate.3.INF - Infinity means an empty room. We use the value 231 - 1 = 2147483647 to rep
原创
发布博客 2015.11.26 ·
440 阅读 ·
0 点赞 ·
0 评论 ·
0 收藏
加载更多