leetcode解题报告(java)
程序员龙湫
全栈开发,阿里&字节 面试官,目前在字节写Android;分享经验与技术干货,帮你少走弯路
展开
-
Power of Two
Power of Two leetcode解题报告原创 2015-08-09 12:16:54 · 824 阅读 · 0 评论 -
Two Sum
Given an array of integers, find two numbers such that they add up to a specific target number.The function twoSum should return indices of the two numbers such that they add up to the target, where原创 2015-07-29 20:24:47 · 711 阅读 · 0 评论 -
3Sum
Given an array S of n integers, are there elements a,b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.Note:Elements in a triplet (a,b,c) m原创 2015-07-29 21:03:35 · 517 阅读 · 0 评论 -
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 o原创 2015-07-29 21:17:28 · 535 阅读 · 0 评论 -
Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values.题目解析:二叉树的前序遍历思路 递归ok,下面至直接上AC代码/** * Definition for a binary tree node. * public class TreeNode { * int val; *原创 2015-07-29 22:32:29 · 479 阅读 · 0 评论 -
Single Number II
Given an array of integers, every element appears three times except for one. Find that single one.Note:Your algorithm should have a linear runtime complexity. Could you implement it without using原创 2015-07-29 22:42:57 · 649 阅读 · 0 评论 -
Add Two Numbers
Add Two Numbers leetcode解题报告原创 2015-08-06 14:02:46 · 793 阅读 · 0 评论 -
Roman to Integer
Roman to Integer leetcode解题报告原创 2015-08-06 20:07:41 · 1063 阅读 · 0 评论 -
Integer to Roman
Integer to Roman leetcode解题报告原创 2015-08-06 20:13:28 · 891 阅读 · 0 评论 -
String to Integer (atoi)
Implement atoi to convert a string to an integer.题目解析:atoi函数 把字符串转为整型思路解析:主要是考虑各种输入的 +123,-123 ,123, 123(空格),算是个比较简单的题目,直接上AC代码 public int myAtoi(String str) { // 安全性检查 if (str.lengt原创 2015-07-29 22:53:50 · 931 阅读 · 0 评论 -
Implement strStr()
Implement strStr().Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.题目解析:找出一个匹配子串的位置所在思路一:普通解法,记录位置双重循环public int strStr(String hays原创 2015-07-29 22:50:10 · 690 阅读 · 0 评论 -
Number of 1 Bits
Number of 1 Bits leetcode解题报告原创 2015-08-09 12:30:16 · 788 阅读 · 0 评论 -
Longest Common Prefix
Longest Common Prefix 解题报告原创 2015-08-09 12:12:35 · 872 阅读 · 0 评论 -
Reverse Bits
Reverse Bits leetcode解题报告原创 2015-08-09 12:26:07 · 925 阅读 · 0 评论 -
Sort Colors
Given an array with n objects colored red, white or blue, sort them so that objects of the same color are adjacent, with the colors in the order red, white and blue.Here, we will use the integers 0,原创 2015-07-29 21:40:26 · 514 阅读 · 0 评论 -
Sort List
Sort a linked list in O(n log n) time using constant space complexity.题目分析:给一个链表排序,这玩意有点不好弄思路解析: 本题先将链表拆成俩个 (拆后要将俩个链表恢复成正常),递归的将俩个字链表排序, 最后将结果合并,思路简单但是操作起来不好弄,直接上AC代码/** * Definition for singl原创 2015-07-29 22:10:47 · 568 阅读 · 0 评论 -
Rotate Array
For example, with n = 7 and k = 3, the array [1,2,3,4,5,6,7] is rotated to[5,6,7,1,2,3,4]. 题目解析:旋转数组思路:双重循环,需要记录每次开始的数,然后移动数组,最后将首位数组互换即可,还是比较简单的,下面是AC代码public void rotate(int[] nums, int k) {原创 2015-07-29 22:28:06 · 829 阅读 · 0 评论 -
Word Break
Given a string s and a dictionary of words dict, determine ifs can be segmented into a space-separated sequence of one or more dictionary words.For example, givens = "leetcode",dict = ["leet",原创 2015-07-29 20:41:05 · 656 阅读 · 0 评论 -
Largest Number
Given a list of non negative integers, arrange them such that they form the largest number.For example, given [3, 30, 34, 5, 9], the largest formed number is9534330.Note: The result may be very原创 2015-07-29 21:59:27 · 654 阅读 · 0 评论 -
Reverse Integer
Reverse Integer 的解题报告原创 2015-08-06 13:56:33 · 690 阅读 · 0 评论