JasonChang

摘要： dynamic programming 1 public class Solution { 2 public static int minCut(String s) { 3 // Start typing your Java solution below 4 // DO NOT write main() function 5 if (s == null) { 6 return 0; 7 } 8 int len = s.length(); 9 int[] cuts = ... 阅读全文

摘要： 注意add arraylist 到 ArrayList>的时候传递引用和传值得区别！！！ 1 public class Solution { 2 public ArrayList> partition(String s) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 ArrayList> result = new Arra... 阅读全文

摘要： BFS 用hashmap记录对应关系 1 public class Solution { 2 public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(node == null) 6 ... 阅读全文

摘要： dynamic programming 1 public class Solution { 2 public boolean wordBreak(String s, Set dict) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(s == null||dict.isEmpty()) 6 re... 阅读全文

摘要： 只有一个答案，找到最后一个不可以的点，下一个是开始点 1 public class Solution { 2 public int canCompleteCircuit(int[] gas, int[] cost) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 int total = 0; 6 int su... 阅读全文

摘要： 两遍遍历，使得左右邻居都合法 1 public class Solution { 2 public int candy(int[] ratings) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 int[] candy = new int[ratings.length]; 6 int count = 0; ... 阅读全文

摘要： fastrunner and slowrunner trick 1 public class Solution { 2 public ListNode detectCycle(ListNode head) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 ListNode fastrunner = head; 6 ... 阅读全文

摘要： 将midnode后面的node的指针反转，再从头尾两边同时遍历注意midnode的next设为null 1 public class Solution { 2 public void reorderList(ListNode head) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 int count = 0; 6 ... 阅读全文

摘要： recursion 1 public class Solution { 2 public ArrayList preorderTraversal(TreeNode root) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 ArrayList result = new ArrayList(); 6 trave... 阅读全文

摘要： recursion programming 1 public class Solution { 2 public TreeNode sortedListToBST(ListNode head) { 3 // IMPORTANT: Please reset any member data you declared, as 4 // the same Solution instance will be reused for each test case. 5 if(head == null) 6 return null... 阅读全文