摘要：
class Solution { public int[] relativeSortArray(int[] arr1, int[] arr2) { int k = 0; int t = 0; int[] res = new int[arr1.length]; ... 阅读全文
摘要：
import java.util.*; class Solution { public int[] intersection(int[] nums1, int[] nums2) { Set set1 = new HashSet(); int len = nums1.length> nums2.length? nums2.length:nums... 阅读全文
摘要：
class Solution { public int twoCitySchedCost(int[][] costs) { if(costs[0].length ==0||costs.length==0) return 0; int [] arr = new int[co... 阅读全文
摘要：
class Solution { public boolean isRobotBounded(String instructions) { int len = instructions.length(); int x = 0; int y = 0; in... 阅读全文