MCPcopy Create free account

hub / github.com/Jensenczx/CodeEveryday / types & classes

Types & classes150 in github.com/Jensenczx/CodeEveryday

ClassCat
99_ToyFactory.java:12
ClassDog
99_ToyFactory.java:5
ClassDoublyListNode
55_bstToDoublyList.java:9
ClassGloves
1_Gloves.java:3
ClassInterval
14_countOfAirplanes.java:1
ClassListNode
10_DeleteNode.java:1
ClassMain
untitled.java:1
ClassMinStack
51_minstack.java:1
ClassPeriods
2_Periods.java:3
ClassQueue
33_QueueByStack.java:1
ClassRandomListNode
54_copyRandomList.java:1
ClassRectangle
101_shapeFactory.java:11
ClassSegmentTree
91_countOfSmallerNumber.java:1
ClassSegmentTree
Definition of Interval: public classs Interval { int start, end; Interval(int start, int end) { this.start = start; this.end =
89_intervalSum.java:10
ClassSegmentTree
Definition of Interval: public classs Interval { int start, end; Interval(int start, int end) { this.start = start; this.end =
88_intervalMinNumber.java:10
InterfaceShape
Your object will be instantiated and called as such: ShapeFactory sf = new ShapeFactory(); Shape shape = sf.getShape(shapeType); shape.draw();
101_shapeFactory.java:7
ClassShapeFactory
101_shapeFactory.java:39
ClassSolution
107_generateParenthesis.java:1
ClassSolution
72_threeSum.java:1
ClassSolution
103_trailingZeros.java:1
ClassSolution
18_backPack.java:1
ClassSolution
9_longestWords.java:1
ClassSolution
87_reverseInteger.java:1
ClassSolution
104_numWays.java:1
ClassSolution
105_reversePairs.java:1
ClassSolution
23_houseRobber.java:1
ClassSolution
29_minPathSum.java:1
ClassSolution
44_mergeTwoLists.java:1
ClassSolution
45_reverse.java:1
ClassSolution
63_median.java:1
ClassSolution
56_maxSubArray.java:1
ClassSolution
43_removeNthFromEnd.java:1
ClassSolution
82_removeElements.java:1
ClassSolution
8_majorityNumber.java:1
ClassSolution
16_1_singleNumber.java:1
ClassSolution
14_countOfAirplanes.java:9
ClassSolution
73_binarySearch.java:1
ClassSolution
71_twosum.java:1
ClassSolution
16_2_aplusb.java:1
ClassSolution
91_countOfSmallerNumber.java:14
ClassSolution
11_BinaryTreePaths.java:12
ClassSolution
50_postorderTraversal.java:1
ClassSolution
27_longestIncreasingContinuousSubsequence.java:1
ClassSolution
110_isugly.java:1
ClassSolution
12_findMissing.java:1
ClassSolution
36_countOnes.java:1
ClassSolution
35_fibonacci.java:1
ClassSolution
30_uniquePaths.java:1
ClassSolution
40_searchMatrix.java:1
ClassSolution
13_plusOne.java:1
ClassSolution
60_digitCounts.java:1
ClassSolution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end, max; public SegmentTreeNode left, right; public Segme
84_segmentTreeQuery.java:14
ClassSolution
48_binaryTreePathSum.java:11
ClassSolution
15_restoreIpAddresses.java:2
ClassSolution
78_listpartition.java:1
ClassSolution
131_productExcludeItself.java:7
ClassSolution
113_maxSquare.java:1
ClassSolution
75_countAndSay.java:1
ClassSolution
54_copyRandomList.java:6
ClassSolution
31_uniquePathsWithObstacles.java:1
ClassSolution
100_paintingHouseMinCost.java:1
ClassSolution
70_partitionArray.java:1
ClassSolution
28_canJump.java:1
ClassSolution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end, max; public SegmentTreeNode left, right; public Segme
86_buildSegmetTree.java:14
ClassSolution
46_numbersByRecursion.java:1
ClassSolution
Definition for singly-linked list. public class ListNode { int val; ListNode next; ListNode(int x) { val = x; } }
106_swapPairs.java:9
ClassSolution
114_minSubArray.java:1
ClassSolution
Definition for ListNode public class ListNode { int val; ListNode next; ListNode(int x) { val = x; next = null; } }
119_deleteDuplicates.java:12
ClassSolution
4_HappyNumber.java:1
ClassSolution
132_hashcode.java:15
ClassSolution
58_getIntersectionNode.java:1
ClassSolution
37_findMinNumInRrveseArray.java:1
ClassSolution
34_fizzBuzz.java:1
ClassSolution
17_TreeisIdentical.java:9
ClassSolution
77_isUnique.java:1
ClassSolution
126_isHappy.java:1
ClassSolution
125_intersection.java:1
ClassSolution
120_singleNumberII.java:1
ClassSolution
129_mergesortedArray.java:9
ClassSolution
5_PermutationIndex.java:1
ClassSolution
38_singleton.java:1
ClassSolution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end; public SegmentTreeNode left, right; public SegmentTre
83_segmentTreeNodeBuild.java:12
ClassSolution
10_DeleteNode.java:10
ClassSolution
59_kthPrimeNumber.java:1
ClassSolution
102_nextPermutation.java:1
ClassSolution
public class SVNRepo { public static boolean isBadVersion(int k); } you can use SVNRepo.isBadVersion(k) to judge whether the kth code version is b
93_findFirstBadVersion.java:8
ClassSolution
19_backPackII.java:1
ClassSolution
127_subarraySum.java:1
ClassSolution
Definition of SegmentTreeNode: public class SegmentTreeNode { public int start, end, max; public SegmentTreeNode left, right; public Segme
85_modifySegmentTree.java:14
ClassSolution
42_partitionArray.java:1
ClassSolution
57_kthLargestElement.java:1
ClassSolution
49_stringPermutation.java:1
ClassSolution
Definition of TreeNode: public class TreeNode { public int val; public TreeNode left, right; public TreeNode(int val) { this.val =
95_sortedArrayToBST.java:12
ClassSolution
121_simplifyPath.java:1
ClassSolution
74_findPeak.java:1
ClassSolution
20_longestCommonSubstring.java:1
ClassSolution
Definition of TreeNode: public class TreeNode { public int val; public TreeNode left, right; public TreeNode(int val) { this.val =
96_minDepth.java:12
ClassSolution
24_MinAdjustmentCost.java:2
ClassSolution
117_maxProfit1.java:1
ClassSolution
81_compareStrings.java:1
next →1–100 of 150, ranked by callers