leetcode
文章平均质量分 69
进击的鼻孔猫
立志成为Fintech领域专家
展开
-
Word Pattern
Given a pattern and a string str, find if str follows the same pattern.Examples:pattern = "abba", str = "dog cat cat dog" should return true.pattern = "abba", str = "dog cat cat fish"原创 2015-10-16 16:06:55 · 550 阅读 · 0 评论 -
Nim Game
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the原创 2015-10-16 16:09:11 · 470 阅读 · 0 评论 -
Move Zeroes
Move ZeroesGiven an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], afte原创 2015-10-19 15:02:12 · 462 阅读 · 0 评论 -
Game of Life
1 题目According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."Given a board原创 2015-10-20 09:54:53 · 447 阅读 · 0 评论 -
Add Digits
1、题目名称Add Digits (非负整数各位相加)2、题目地址https://leetcode.com/problems/add-digits3、题目内容英文:Given a non-negative integer num, repeatedly add all its digits until the result has only one di原创 2015-10-20 15:29:21 · 486 阅读 · 0 评论 -
Single Number
Given an array of integers, every element appears twice except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using e原创 2015-10-21 15:01:34 · 406 阅读 · 0 评论 -
Maximum Depth of Binary Tree
要求:求二叉树的深度(二叉树的深度为最远叶子节点到根节点的距离,即根节点到最远叶子节点的距离)Given a binary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest原创 2015-10-22 14:40:11 · 555 阅读 · 0 评论