夜雨柠檬

class MyCircularDeque { private int front; private int rear; private int size; private int[] arr; private int maxSize; /** Initialize your data structure here. Set the size of...

Java codeclass Solution { public int removeDuplicates(int[] nums) { int count1 = 0; int count2 = 0; int temp = 0; for(int i = 0; i < nums.length - count1; i++) ...

Java codeclass Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode l = new ListNode(0); ListNode temp = l; while(l1 != null && l...

Java codeclass Solution { public int romanToInt(String s) { int sum = 0; char[] c = s.toCharArray(); for(int i = 0; i < c.length; i++) { if(c[i] == 'I') { ...

Java codeclass Solution { public int reverse(int x) { boolean flag = false; if(x < 0) { flag = true; x = -x; } String s1 = Integer.toStr...

Java code/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public ListNode r...

Java codeclass Solution { public boolean isPalindrome(int x) { String s = Integer.toString(x); char[] c = s.toCharArray(); int i = 0; int j = 0; for(; i &l...

Java codeclass Solution { public ListNode addTwoNumbers(ListNode l1, ListNode l2) { int n = 0; int n1 = 0; int n2 = 0; int m = 0; ListNode temp = new ListN...

Java code/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { val = x; } * } */class Solution { public ListNode r...

Java codeclass Solution { public int[] twoSum(int[] nums, int target) { for(int i = 0; i < nums.length - 1; i++) { for(int j = i + 1; j < nums.length; j++) { ...

Java codeclass Solution { public int search(int[] nums, int target) { int length = nums.length; int front = 0; int rear = length - 1; int mid; whi...

Java codeclass Solution { public ListNode removeNthFromEnd(ListNode head, int n) { if(n == 0) { return head; } ListNode temp = head; int length = 0; ...

class MyCircularQueue { private int front; private int rear; private int maxSize; private int size; private int[] arr; /** Initialize your data structure here. Set the siz...

Java codeclass MinStack { class Node { int val; Node next; public Node(int val) { this.val = val; } } Node headNode; /** initializ...