leetcode
草帽boy7
/ynmianyan/10927062
展开
-
leetcode 46 题 全排列
func permute(nums []int) [][]int { if len(nums) == 1 { o1 := make([][]int,1) o1 [0] =[]int{1} return o1 } if len(nums) == 2{ res := make([][]int,0) res = append(res,...原创 2020-01-06 00:35:11 · 74 阅读 · 0 评论 -
leetcode第739 题
class Solution { public int[] dailyTemperatures(int[] T) { int length = T.length; int[] result = new int[length]; //从右向左遍历 for (int i = length - 2; i >= 0; i--) { // j+= re...原创 2020-01-05 21:24:47 · 184 阅读 · 0 评论