数据结构与算法
微观尽头
求木之长者,必固其根本
展开
-
【算法精选】leetcode15 - 3sum
题目介绍:Given an arraynumsofnintegers, are there elementsa,b,cinnumssuch thata+b+c= 0? Find all unique triplets in the array which gives the sum of zero.Note:The solution set must n...原创 2019-04-19 20:32:21 · 90 阅读 · 0 评论 -
LeetCode--18--medium--FourSum
package com.app.main.LeetCode;import java.util.ArrayList;import java.util.Arrays;import java.util.List;/** * id = 18 * level = medium * Given an array nums of n integers and an integer targe...原创 2019-09-04 21:16:19 · 117 阅读 · 0 评论 -
LeetCode--15--medium--ThreeSum
package com.app.main.LeetCode;import java.util.ArrayList;import java.util.Arrays;import java.util.List;/** * * id = 15 * level = medium * Given an array nums of n integers, are there elemen...原创 2019-09-04 21:15:37 · 75 阅读 · 0 评论 -
LeetCode--1--easy--TwoSum
package com.app.main.LeetCode;import java.util.HashMap;import java.util.HashSet;import java.util.Map;import java.util.Set;/** * * id = 1 * * level = easu * Created with IDEA * author:Di...原创 2019-09-04 21:14:30 · 98 阅读 · 0 评论 -
BST树Java实现
package com.app.main.datastructure;/** * BST 树 实现 * Created with IDEA * author:Dingsheng Huang * Date:2019/8/19 * Time:下午7:22 */public class BstTree { static class TreeNode { in...原创 2019-08-20 14:29:00 · 699 阅读 · 0 评论 -
LeetCode--232--easy--ImplementQueueUsingStacks
package com.app.main.LeetCode;import java.util.Stack;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/7/22 * Time:下午7:15 * * id = 232 * * level = easy * * Implement the foll...原创 2019-07-22 20:39:35 · 124 阅读 · 0 评论 -
LeetCode--225--easy--ImplementStackUsingQueues
package com.app.main.LeetCode;import java.util.Deque;import java.util.LinkedList;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/7/22 * Time:下午8:16 * * id = 225 * * level = ...原创 2019-07-22 20:38:20 · 157 阅读 · 0 评论 -
LeetCode--25--hard--ReverseNodes In K-Group
package com.app.main.LeetCode;import com.app.main.LeetCode.base.ListNode;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/7/1 * Time:下午7:57 * 题目信息: * level = hard * id = 25 *...原创 2019-07-10 20:58:02 · 113 阅读 · 0 评论 -
LeetCode--142--medium--LinkedListCycleII
题目信息:(链表判断是否有环,并且找到环入口节点)* levev = medium* id = 142** Given a linked list, return the node where the cycle begins. If there is no cycle, return null.** To represent a cycle in the given linke...原创 2019-06-30 18:31:14 · 126 阅读 · 0 评论 -
LeetCode--141--easy--LinkedListCycle
package com.app.main.LeetCode;import com.app.main.LeetCode.base.ListNode;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/6/29 * Time:下午9:04 * 题目信息: * level = easy * id = 141 ...原创 2019-06-29 21:26:01 · 214 阅读 · 0 评论 -
LeetCode--24--medium--SwapNodesInPairs
package com.app.main.LeetCode;import com.app.main.LeetCode.base.ListNode;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/6/29 * Time:下午5:39 * *题目信息: * level = medium * id = 2...原创 2019-06-29 18:01:41 · 121 阅读 · 0 评论 -
LeetCode--206--easy--ReverseLinkedList
package com.app.main.LeetCode;import com.app.main.LeetCode.base.ListNode;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/6/29 * Time:上午11:52 * * 题目信息: * level = easy * id =...原创 2019-06-29 17:30:43 · 110 阅读 · 0 评论 -
LeetCode--20--easy--Valid Parentheses
package com.app.main.LeetCode;/** * Created with IDEA * author:Dingsheng Huang * Date:2019/6/28 * Time:下午8:19 */import java.util.HashMap;import java.util.Map;import java.util.Stack;/** ...原创 2019-06-28 20:45:18 · 187 阅读 · 0 评论 -
LeetCode--11--medium--ContainerWithMostWater
package com.app.main.LeetCode;/** * * 11 * medium * * Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that ...原创 2019-09-24 21:14:08 · 115 阅读 · 0 评论