LeetCode
文章平均质量分 55
转向者
不放弃梦想,不放弃现实!
展开
-
LeetCode——TwoSum
题目: 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,原创 2014-12-15 23:06:52 · 679 阅读 · 0 评论 -
LeetCode--Merge Two Sorted Lists
题目: Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 解决方案: /** * Definition for singly-linked list.原创 2014-12-24 21:16:57 · 548 阅读 · 0 评论 -
LeetCode--Pascal's Triangle
题目: 解决方案: public class Solution { public List> generate(int numRows) { List> lists=new ArrayList>(); for(int i=0;i<numRows;i++){ List list=new ArrayList();原创 2014-12-27 11:09:28 · 610 阅读 · 0 评论 -
LeetCode--Same Tree
题目: Given two binary trees, write a function to check if they are equal or not. Two binary trees are considered equal if they are structurally identical and the nodes have the same value. 解决方原创 2014-12-28 22:23:57 · 565 阅读 · 0 评论 -
LeetCode--Min Stack
题目: Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. push(x) -- Push element x onto stack. pop() -- Removes the element on top of the stack. top(原创 2014-12-28 16:37:28 · 616 阅读 · 0 评论 -
LeetCode--Excel Sheet Column Title
题目: 下面有两种解决方案,但是觉得效率都不太高。 解决方案1: public class Solution { public String convertToTitle(int n) { return convertToTitle(--n / 26) + (char)('A' + (n % 26)); } } 解决方案2: public class原创 2014-12-28 20:39:53 · 1102 阅读 · 0 评论 -
LeetCode--Majority Element
题目: Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times. You may assume that the array is non-empty and the majority eleme原创 2014-12-29 20:23:06 · 521 阅读 · 0 评论 -
LeetCode--Length of Last Word
题目: 解决方法: public class Solution { public int lengthOfLastWord(String s) { if (s.trim().length() == 0) { return 0; } String[] str = s.split(" "); r原创 2014-12-29 20:34:57 · 503 阅读 · 0 评论 -
LeetCode--Plus One
这个题目与java里的BigInteger实现有些类似,可以参考其源码。 题目: Given a non-negative number represented as an array of digits, plus one to the number. The digits are stored such that the most significant digit is a原创 2014-12-29 21:16:27 · 533 阅读 · 0 评论 -
LeetCode--Implement strStr()
题目: 我的方案: public class Solution { public int strStr(String haystack, String needle) { int hslen=haystack.length(); int nllen=needle.length(); int rlen=-1;原创 2014-12-22 14:28:00 · 524 阅读 · 0 评论 -
LeetCode--Remove Element
这个题目没有动手实践,只是想了个思路,结果一看讨论区的代码瞬间感觉,我想的太复杂了。ps:有点想不明白,既然是要移除元素,为何不留下一个不含删除元素的纯净数组。 题目: Given an array and a value, remove all instances of that value in place and return the new length. The order of原创 2014-12-21 22:35:17 · 598 阅读 · 0 评论 -
LeetCode--Valid Parentheses
这个题目我采用了两种方案,第一种方案代码行数相对较少,但效率稍低,第二种方案参照网上的进行改进代码行数相对多些,但效率稍高。 题目: Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brack原创 2014-12-21 20:40:22 · 539 阅读 · 0 评论 -
LeetCode--ZigZag Conversion
本来想按照时间先后顺序来做LeetCode的题,由于非科班出身,好多东西都不太懂,今天调整思路,先做难度为easy的题。 题目: 我的java解决方案: public class Solution { public String convert(String s, int nRows) { char [] cArray=s.toCharArray(); Str原创 2014-12-18 14:56:24 · 635 阅读 · 0 评论 -
LeetCode--String to Integer (atoi)
题目: 解决方法: public class Solution { public int atoi(String s) { int MAX=2147483647; int MIN=-2147483648; s = s.trim();//1.去除空格 long value = 0; int flag原创 2014-12-19 21:37:45 · 504 阅读 · 0 评论 -
LeetCode--Reverse Integer
题目: 可以点击“click to show spoilers”,查看需要考虑的问题。我是做题的时候没有查看,结果里面给出的三个注意的地方只考虑了两个,导致提交之后溢出,之后又重新考虑。 我的解决方案: public class Solution { public int reverse(int x) { char[] sArray = String.va原创 2014-12-19 11:14:41 · 563 阅读 · 0 评论 -
LeetCode--Roman to Integer
这个题目很简单,只是不了解数字与罗马数字转换关系的话就无从下手了。 题目: 原理与思路: 罗马数字有如下符号: 基本字符 I V X L C D M 对应阿拉伯数字 1 5 10 50 100 500 1000 计数规则: 相同的数字连写,所表示的数等于这些数字相加得到的数原创 2014-12-20 10:21:36 · 587 阅读 · 0 评论 -
LeetCode-- Longest Common Prefix
题目: Write a function to find the longest common prefix string amongst an array of strings. 第一种解决方案: public class Solution { public String longestCommonPrefix(String[] strs) { int st原创 2014-12-20 22:52:20 · 526 阅读 · 0 评论 -
LeetCode--Palindrome Number
题目的意思是判断数字是否为回文。本文用了两种方法,一种效率稍高,但代码稍稍多几行;一种代码稍少,但效率稍稍低点。 题目: 我的第一种解决方案: public class Solution { public boolean isPalindrome(int x) { boolean is=true; if(x>=0){ /原创 2014-12-19 22:54:11 · 570 阅读 · 0 评论 -
LeetCode--Remove Nth Node From End of List
题目: 思路: 题目说 one pass 那么,这样,用两个结点(相当于c++的指针)p,q p先跑n步,然后q和p一起跑,那么p跑到最后,q就正好在倒数第n个上面了。 ps:看了别人的代码,好多都是建立一个不用的头,然后真正的头在next里面,这样代码要少了单独处理头的那部分。 解决方案: /** * Definition for singly-linke原创 2014-12-21 15:49:09 · 557 阅读 · 0 评论 -
LeetCode--Remove Duplicates from Sorted Array
题目: Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length. Do not allocate extra space for another array, you must do this in place w原创 2014-12-21 22:06:07 · 556 阅读 · 0 评论 -
LeetCode--Path Sum
题目: 解决方案: /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ public class Solu原创 2015-01-03 19:29:31 · 588 阅读 · 0 评论