IT技术分享

[LeetCode 167] Two Sum II - Input array is sorted [Java]

1. DescriptionGiven an array of integers that is already sorted in ascending order, find two numbers such that they add up to a specific ...

顿搜

2017-11-23

672 阅读

0 评论

2017年11月23日

672 阅读

0 评论

[LeetCode 27] Remove Element [Java]

1. DescriptionGiven an array and a value, remove all instances of that value in-place and return the new length.Do not allocate extra spa...

顿搜

2017-11-23

652 阅读

0 评论

2017年11月23日

652 阅读

0 评论

[LeetCode 24] Swap Nodes in Pairs [Java]

1. DescriptionGiven a linked list, swap every two adjacent nodes and return its head.Your algorithm should use only constant space. You m...

顿搜

2017-11-23

601 阅读

0 评论

2017年11月23日

601 阅读

0 评论

[LeetCode 21] Merge Two Sorted Lists [Java]

1. DescriptionMerge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of th...

顿搜

2017-11-23

631 阅读

0 评论

2017年11月23日

631 阅读

0 评论

[LeetCode 20] Valid Parentheses [Java]

1. DescriptionGiven a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.The b...

顿搜

2017-11-23

766 阅读

0 评论

2017年11月23日

766 阅读

0 评论

2017-11-07

[LeetCode 224] Basic Calculator [Java]

1. DescriptionImplement a basic calculator to evaluate a simple expression string.The expression string may contain open ( and closing pa...

顿搜

2017-11-07

1,021 阅读

0 评论

2017年11月07日

1,021 阅读

0 评论

2017-11-07

[LeetCode 227] Basic Calculator II [Java]

1. DescriptionImplement a basic calculator to evaluate a simple expression string.The expression string contains only non-negative intege...

顿搜

2017-11-07

870 阅读

0 评论

2017年11月07日

870 阅读

0 评论

2017-11-06

[LeetCode 334] Increasing Triplet Subsequence [Java]

1. DescriptionGiven an unsorted array return whether an increasing subsequence of length 3 exists or not in the array.Formally the functi...

顿搜

2017-11-06

740 阅读

0 评论

2017年11月06日

740 阅读

0 评论

[LeetCode 144] Binary Tree Preorder Traversal [Java]

1. DescriptionGiven a binary tree, return the preorder traversal of its nodes' values.Note: Recursive solution is trivial, could you do i...

顿搜

2017-11-04

583 阅读

0 评论

2017年11月04日

583 阅读

0 评论

[LeetCode 87] Scramble String [Java]

1. DescriptionGiven a string s1, we may represent it as a binary tree by partitioning it to two non-empty substrings recursively.2. Examp...

顿搜

2017-11-04

721 阅读

0 评论

2017年11月04日

721 阅读

0 评论

[POJ 2287] Tian Ji -- The Horse Racing [Java]

1. DescriptionHere is a famous story in Chinese history. That was about 2300 years ago. General Tian Ji was a high official in the countr...

顿搜

2017-11-04

703 阅读

0 评论

2017年11月04日

703 阅读

0 评论

[LeetCode 301] Remove Invalid Parentheses [Java]

1. DescriptionRemove the minimum number of invalid parentheses in order to make the input string valid. Return all possible results.Note:...

顿搜

2017-11-04

666 阅读

0 评论

2017年11月04日

666 阅读

0 评论

[LeetCode 239] Sliding Window Maximum [Java]

1. DescriptionGiven an array nums, there is a sliding window of size k which is moving from the very left of the array to the very right....

顿搜

2017-11-04

804 阅读

0 评论

2017年11月04日

804 阅读

0 评论

2017-10-26

[Template] Binary Index Tree

import java.util.Scanner; public class BinaryIndexedTreeTemplate { private static int[] tree; public static void main(String[]...

顿搜

2017-10-26

681 阅读

0 评论

2017年10月26日

681 阅读

0 评论

2017-10-26

[Template] Segment Tree

import java.util.Scanner; class Tree { int left; int right; int count; //Stand for what you want to record Tree(int l, ...

顿搜

2017-10-26