-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
113 lines (96 loc) · 4.25 KB
/
Copy pathMain.java
File metadata and controls
113 lines (96 loc) · 4.25 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
import nowcoder.*;
public class Main {
public static void main(String[] args) {
// nowcoder.solution19 nowcoder.solution19 = new nowcoder.solution19();
// System.out.println(nowcoder.solution19.isValid("((())"));
// solution155 solution155 = new solution155();
// solution155.push(-1);
// Stack stack = new Stack<Integer>();
// stack.push(1);
// stack.push(2);
// System.out.println(stack);
// solution739 s = new solution739();
// int[] t = {73,74,75,71,69,72,76,73};
// t = s.dailyTemperatures(t);
// MyCircularQueue obj = new MyCircularQueue(3);
// obj.enQueue(1);
// obj.enQueue(2);
// obj.enQueue(3);
// boolean param_1 = obj.enQueue(4);
//
// boolean param_2 = obj.deQueue();
// boolean param_321 = obj.enQueue(4);
// int param_3 = obj.Front();
// int param_4 = obj.Rear();
// boolean param_5 = obj.isEmpty();
// boolean param_6 = obj.isFull();
// nowcoder.ListNode a = new nowcoder.ListNode(1);
// nowcoder.ListNode b = new nowcoder.ListNode(2);
// nowcoder.ListNode c = new nowcoder.ListNode(3);
// a.next = b;
// b.next = c;
// nowcoder.solution6 nowcoder.solution6 = new nowcoder.solution6();
// nowcoder.solution6.printListFromTailToHead(a);
// nowcoder.solution14_2 nowcoder.solution14_2 = new nowcoder.solution14_2();
// nowcoder.solution14_2.integerBreak(9);
// solution19 solution20 = new solution19();
// char[] str= {'a','a','b','b','c'};
// char[] pattern = {'a','*','b','.','c'};
// solution20.match(str,pattern);
// solution29 solution29 = new solution29();
// int[][] a = {{1,2},{3,4}};
// solution29.printMatrix(a);
// solution31 solution31 = new solution31();
// int[] a = {1,2,3,4,5};
// int[] b = {4,5,3,2,1};
// solution31.IsPopOrder(a,b);
// solution33 solution33 = new solution33();
// int[] a = {3,4,6,5};
// solution33.VerifySquenceOfBST(a);
// solution38_2 solution38 = new solution38_2();
// solution38.Permutation("aac");
// solution40_2 solution40_2 = new solution40_2();
// int[] input = {2,3,4,5,1,2,1,33,4,5,1,2,1};
// solution40_2.GetLeastNumbers_Solution(input,3);
// solution41 solution41 = new solution41();
// int[] input = {2,3,4,5,1,2,1,33,4,5,1,2,1};
// for(int num:input)
// {
// solution41.Insert(num);
// }
// solution41.GetMedian();
// solution46 solution46 = new solution46();
// solution46.numDecoding("1228");
// solution49 solution49 =new solution49();
// System.out.println(solution49.GetUglyNumber_Solution(7));
// solution51 solution51 = new solution51();
// int[] a = {7,5,6,4};
// solution51.InversePairs(a);
// solution53 solution53 = new solution53();
// int[] a = {1,2,3,3,3,3,5,5};
// solution53.GetNumberOfK(a,3);
// solution58 solution58 = new solution58();
// solution58.ReverseSentence("I am A student");
// solution66 solution66 = new solution66();
// int[] a = {1,2,3};
// solution66.multiply(a);
// solution680_2 solution680 = new solution680_2();
// solution680.validPalindrome("cupuufxoohdfpgjdmysgvhmvffcnqxjjxqncffvmhvgsymdjgpfdhooxfuupucu");
// solution423 solution423 = new solution423();
// solution423.originalDigits("zeroonetwothreefourfivesixseveneightnine");
// solution406 solution406 = new solution406();
// int[][] a = {{7,0},{4,4},{7,1},{5,0},{6,1},{5,2}};
// solution406.reconstructQueue(a);
// solution665 solution665 = new solution665();
// int[] nums = {4,2,3};
// System.out.println(solution665.checkPossibility(nums));
// solution69 solution69 = new solution69();
// System.out.println(solution69.mySqrt(2147483647));
// solution744 solution744 = new solution744();
// char[] c = {'c','f','z'};
// System.out.println(solution744.nextGreatestLetter(c,'c'));
solution34 solution34 = new solution34();
int[] a = {3,7,7,8,8,10};
int[] b =solution34.searchRange(a,6);
}
}