- 博客(10)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 Problem B. Super 2048
Problem B. Super 2048This contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-Start Guid
2014-09-10 17:39:26
771
原创 Problem A. Seven-segment Display
Problem A. Seven-segment DisplayThis contest is open for practice. You can try every problem as many times as you like, though we won't keep track of which problems you solve. Read the Quick-S
2014-09-10 17:22:55
1214
转载 Github上README.md介绍
用github也1.年半了,虽然在上面也陆陆续续的建了些工程。但要么就是fork别人的，要么就是自己练习用的。今天终于开了下荤,建了个开源的小项目。但发现写README.md还是需要些技巧。这里记录下来. 针对中文,演示Markdown的各种语法Markdown代码 大标题 ==================================
2014-07-11 14:52:40
624
转载 warning: LF will be replaced by CRLF | fatal: CRLF would be replaced by LF
遇到这两个错误， 基本上都是叫你将 autocrlf 设置为 false. 但是我觉得这样很不妥。如果你的源文件中是换行符是LF，而autocrlf=true, 此时git add就会遇到 fatal: LF would be replaced by CRLF 的错误。有两个解决办法：1. 将你的源文件中的LF转为CRLF即可【推荐】2. 将autocrlf 设
2014-07-11 14:36:50
1081
原创 Word Break----leetcode
Given a string s and a dictionary of words dict, determine if s can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet"
2014-05-05 17:52:26
471
原创 Longest Consecutive Sequence ----leetcode
Given an unsorted array of integers, find the length of the longest consecutive elements sequence.For example,Given [100, 4, 200, 1, 3, 2],The longest consecutive elements sequence is [1, 2, 3
2014-05-05 16:03:26
492
原创 Word Ladder----leetcode
Given two words (start and end), and a dictionary, find the length of shortest transformation sequence from start to end, such that:Only one letter can be changed at a timeEach intermediate word m
2014-05-05 15:50:35
499
原创 Binary Tree Maximum Path Sum----leetcode
Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, 1 / \ 2 3Return 6.
2014-05-05 15:41:49
443
原创 Valid Palindrome----leetcode
Given a string, determine if it is a palindrome, considering only alphanumeric characters and ignoring cases.For example,"A man, a plan, a canal: Panama" is a palindrome."race a car" is not a
2014-05-05 15:31:09
451
原创 Surrounded Regions----leetcode
Given a 2D board containing 'X' and 'O', capture all regions surrounded by 'X'.A region is captured by flipping all 'O's into 'X's in that surrounded region.For example,
2014-05-05 15:24:02
511
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人