leetcode
sjtu_chenchen
硕士毕业于上海交通大学,先后就职于各类大厂,在java、devops、大数据实时计算方向有深入的研究
展开
-
Leetcode || Letter Combinations of a Phone Number
Given a digit string, return all possible letter combinations that the number could represent.不知道有多少数字,很难遍历,那就用遍历的极端情况,递归package pack;import java.util.ArrayList;import java.util.HashMap;import java.u原创 2015-11-03 21:32:04 · 364 阅读 · 0 评论 -
LeetCode || 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 in原创 2015-10-15 20:20:44 · 367 阅读 · 0 评论 -
Leetcode || Substring with Concatenation of All Words
You are given a string, s, and a list of words, words, that are all of the same length. Find all starting indices of substring(s) in s that is a concatenation of each word in words exactly once and wit原创 2015-11-09 12:26:48 · 353 阅读 · 0 评论 -
Leetcode || Palindrome Number
Determine whether an integer is a palindrome. Do this without extra space.Some hints: Could negative integers be palindromes? (ie, -1)If you are thinking of converting the integer to string, note the原创 2015-10-25 20:16:19 · 398 阅读 · 0 评论 -
Leetcode || Search for a Range
Given a sorted array of integers, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target is not found in the ar原创 2015-11-12 10:56:13 · 380 阅读 · 0 评论 -
Leetcode || Roman to Integer
package pack;/* * 从前向后遍历罗马数字,如果某个数比前一个数小,则加上该数。 * 反之,减去前一个数的两倍然后加上该数。 */class Solution { private int getInteger(char ch) { switch(ch) { case 'I' : return 1; c原创 2015-10-29 12:03:08 · 330 阅读 · 0 评论 -
Leetcode || Integer to Roman
Given an integer, convert it to a roman numeral.Input is guaranteed to be within the range from 1 to 3999.package pack;class Solution { public String intToRoman(int num) { int[] d = new int原创 2015-10-29 09:56:08 · 355 阅读 · 0 评论 -
Leetcode || Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.Subscribe to see which companies asked this questionclass Solution { public String longestCommonPrefix(Stri原创 2015-10-29 19:17:18 · 351 阅读 · 0 评论 -
Leetcode || Container With Most Water
Given n non-negative integers a1, a2, …, an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lin原创 2015-10-29 10:13:32 · 369 阅读 · 0 评论 -
Leetcode || 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.package pack;import java.util.ArrayList;impor原创 2015-10-30 10:54:49 · 388 阅读 · 0 评论 -
Leetcode || 4Sum
Given an array S of n integers, are there elements a, b, c, and d in S such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.在3Sum基础上改改就行package pack;原创 2015-10-30 12:15:30 · 350 阅读 · 0 评论 -
Leetcode || 3Sum Closest
Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly原创 2015-10-30 12:03:33 · 434 阅读 · 0 评论 -
Leetcode || Remove Nth Node From End of List
Given a linked list, remove the nth node from the end of list and return its head.package pack;class ListNode { int val; ListNode next; ListNode(int x) { val = x; }}class Solution { pu原创 2015-10-31 09:19:01 · 310 阅读 · 0 评论 -
Leetcode || Valid Parentheses
Given a string containing just the characters ‘(‘, ‘)’, ‘{‘, ‘}’, ‘[’ and ‘]’, determine if the input string is valid.The brackets must close in the correct order, “()” and “()[]{}” are all valid but “原创 2015-11-03 21:59:42 · 397 阅读 · 0 评论 -
LeetCode 题目总结/分类
注:此分类仅供大概参考,没有精雕细琢。有不同意见欢迎评论~利用堆栈: http://oj.leetcode.com/problems/evaluate-reverse-polish-notation/ http://oj.leetcode.com/problems/longest-valid-parentheses/ (也可以用一维数组,贪心) http://oj.leetcode.com/p转载 2015-11-29 17:00:52 · 570 阅读 · 0 评论 -
Leetcode || Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “原创 2015-10-17 16:04:06 · 344 阅读 · 0 评论 -
Leetcode || Median of Two Sorted Arrays
There are two sorted arrays nums1 and nums2 of size m and n respectively. Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).public double findMedianSorted原创 2015-10-18 23:36:37 · 286 阅读 · 0 评论 -
Leetcode || Swap Nodes in Pairs
Given a linked list, swap every two adjacent nodes and return its head.For example, Given 1->2->3->4, you should return the list as 2->1->4->3.Your algorithm should use only constant space. You may no原创 2015-11-04 11:02:25 · 401 阅读 · 0 评论 -
Leetcode || Reverse Nodes in k-Group
Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. For example, Given this linked list: 1->2->3->4->5For k = 2, you should return: 2->1->4->3->5For k =原创 2015-11-04 13:02:25 · 386 阅读 · 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.package pack;class ListNode { int val; ListNode next原创 2015-11-03 18:34:39 · 411 阅读 · 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 with cons原创 2015-11-05 11:31:23 · 353 阅读 · 0 评论 -
Leetcode || Remove Element
Given an array and a value, remove all instances of that value in place and return the new length.The order of elements can be changed. It doesn’t matter what you leave beyond the new length.最直接的方法是数组遍原创 2015-11-05 12:13:52 · 356 阅读 · 0 评论 -
Leetcode || Implement strStr()
Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.package pack;class Solution { public int strStr(String haystack, String needle) { if原创 2015-11-05 20:53:47 · 353 阅读 · 0 评论 -
Leetcode || Divide Two Integers
Divide two integers without using multiplication, division and mod operator.If it is overflow, return MAX_INT.看了网上的拆分思路,逻辑写出来是不难的,但-2147483648/1和-2147483648/-1是难点package pack;class Solution { publi原创 2015-11-06 10:34:21 · 321 阅读 · 0 评论 -
Leetcode || String to Integer (atoi)
Implement atoi to convert a string to an integer.Hint: Carefully consider all possible input cases. If you want a challenge, please do not see below and ask yourself what are the possible input cases.N原创 2015-10-23 12:38:51 · 346 阅读 · 0 评论 -
Leetcode || Add Two Numbers
You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linke原创 2015-10-16 19:32:19 · 377 阅读 · 0 评论 -
Leetcode || ZigZag Conversion
package pack;class Solution { public String convert(String s, int numRows) { String str = ""; if((s==null || s.isEmpty()) || s.length()==1 || numRows==1) { return s;原创 2015-10-23 09:59:24 · 376 阅读 · 0 评论 -
Leetcode || Longest Palindromic Substring
Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring. class Solution { publ原创 2015-10-21 10:11:07 · 352 阅读 · 0 评论 -
Leetcode || Reverse Integer
package pack;class Solution { public int reverse(int x) { if(x > 0) { return reverse_p(x); } else if(x == 0) { return x; } else原创 2015-10-23 11:11:22 · 372 阅读 · 0 评论 -
Leetcode || Valid Sudoku
Determine if a Sudoku is valid, according to: Sudoku Puzzles - The Rules.The Sudoku board could be partially filled, where empty cells are filled with the character ‘.’.public class Solution { static原创 2015-11-08 13:43:03 · 368 阅读 · 0 评论 -
Leetcode || Count and Say
The count-and-say sequence is the sequence of integers beginning as follows: 1, 11, 21, 1211, 111221, …1 is read off as “one 1” or 11. 11 is read off as “two 1s” or 21. 21 is read off as “one 2, the原创 2015-11-08 14:27:53 · 427 阅读 · 0 评论 -
Leetcode || Evaluate Reverse Polish Notation
Evaluate the value of an arithmetic expression in Reverse Polish Notation.Valid operators are +, -, *, /. Each operand may be an integer or another expression.Some examples: [“2”, “1”, “+”, “3”, ““]原创 2016-02-01 12:32:53 · 406 阅读 · 0 评论