leetcode
朵朵_calm
这个作者很懒,什么都没留下…
展开
-
Leetcode.258. Add Digits
Given a non-negative integer num, repeatedly add all its digits until the result has only one digit.For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has only one digit, r原创 2016-05-03 20:00:52 · 193 阅读 · 0 评论 -
Leetcode.344. Reverse String
Write a function that takes a string as input and returns the string reversed.public class Solution { public String reverseString(String s) { StringBuffer sb=new StringBuffer(s); sb.原创 2016-05-03 19:40:55 · 216 阅读 · 0 评论 -
Leetcode.292.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原创 2016-05-03 19:57:41 · 225 阅读 · 0 评论 -
LeetCode.283. Move Zeroes
Given 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], after calling your funct原创 2016-05-03 20:08:19 · 201 阅读 · 0 评论 -
LeetCode.345. Reverse Vowels of a String
Write a function that takes a string as input and reverse only the vowels of a string.Example 1: Given s = “hello”, return “holle”.Example 2: Given s = “leetcode”, return “leotcede”.public class Solu原创 2016-05-03 20:12:23 · 246 阅读 · 0 评论 -
LeetCode.342. Power of Four
Given an integer (signed 32 bits), write a function to check whether it is a power of 4.Example: Given num = 16, return true. Given num = 5, return false.Follow up: Could you solve it without loops/re原创 2016-05-03 20:17:30 · 169 阅读 · 0 评论 -
LeetCode.343. Integer Break
Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers. Return the maximum product you can get.For example, given n = 2, return 1原创 2016-05-03 20:18:28 · 196 阅读 · 0 评论 -
LeetCode.104. Maximum Depth of Binary Tree
数据结构没学好,对这个题没有思路,简单看了下二叉树的基本概念。找了一份正确答案研究。public class Solution { public int maxDepth(TreeNode root) { if (root == null){ return 0; } List <Integer> res = new ArrayList原创 2016-05-09 10:14:36 · 218 阅读 · 0 评论 -
LeetCode.13. Roman to Integer
我的答案:67.72%public class Solution { public int romanToInt(String s) { char[] arr=s.toCharArray(); int leng=arr.length; if(leng<2) return change(arr[0]); int sum=change原创 2016-06-22 10:07:45 · 183 阅读 · 0 评论