fenglvming的专栏

public int removeElement(int[] A, int elem) { // Start typing your Java solution below // DO NOT write main() function int length = A.length; int count = 0; int

public double findMedianSortedArrays(int a[], int b[]) { // Start typing your Java solution below // DO NOT write main() function int length = a.length + b.length; int

public boolean train(List in ,List out, int number){ boolean ret = true; if(in == null || out == null){ return false; } if(in.size() != number || out.size() != number){ return false; }

public boolean isValid(String s) { // Start typing your Java solution below // DO NOT write main() function if(s == null || "".equals(s)){ return true; } Stack

public class Solution { public ArrayList generateParenthesis(int n) { // Start typing your Java solution below // DO NOT write main() function ArrayList ret = new ArrayList();

public int lengthOfLongestSubstring(String s) { // Start typing your Java solution below // DO NOT write main() function int max = 0; int tempMax = 0; int lengt

public int removeDuplicates(int[] A) { // Start typing your Java solution below // DO NOT write main() function if(A == null || A.length == 0){ return 0; }

public ListNode mergeKLists(ArrayList lists) { // Start typing your Java solution below // DO NOT write main() function ListNode head = null; ListNode cur = head;

public ListNode addTwoNumbers(ListNode l1, ListNode l2) { // Start typing your Java solution below // DO NOT write main() function ListNode head = null; ListNode next = null;

public int reverse(int x) { if(x == 0) return 0; String s = Integer.toString(x); //起点 boolean isNegative = false; int start = 0; if(s.charAt(