DreamyLee

Results 21 comments of DreamyLee

@Tokics 楼上大佬们解释得很清晰啦,我再来补充点看会不会更具体些? 1.先看原来2D情况,dp[i][j]的值,都是仅依靠上一行dp[i-1][...]得出的。意思是我们要算当前dp[i]行的值,仅需要上一行dp[i-1]就好。所以可以将其转化为:原地更新1D数组问题; 2.现在考虑降为1D,定义该1D数组为int[] dp。回忆原来2D情况,dp[i][j]的值都是依靠“其正上方的值dp[i-1][j]+左上方的值dp[i-1][j-nums[i]]”来更新。那么如果对1D进行正向遍历即从dp[0]->dp[n-1]填充,对于某一位例如dp[cur]的更新,势必会用到dp[pre](predp[0]填充。同样,对于某一位例如dp[cur]的更新,势必会用到dp[pre](pre

@labuladong 东哥,这里有笔误哇? “如果你不把这第 i 个物品装入背包,也就是说你不使用 coins[i] (应该是coins[i-1]?)这个面值的硬币,那么凑出面额 j 的方法数 dp[i][j] 应该等于 dp[i-1][j],继承之前的结果。 如果你把这第 i 个物品装入了背包,也就是说你使用 coins[i] (应该是coins[i-1]?)这个面值的硬币,那么 dp[i][j] 应该等于 dp[i][j-coins[i-1]]。”

@Rayso777 你好,我也是小白,但我这样理解的,希望能帮到你。实质这就是在穷举呀。回溯算法的思路就是:1.算法过程中穷举所有组合(满足题目条件的组合/不满足题目条件的组合);2.从所有组合中排除不满足条件的组合,最后得到满足条件的组合。放到这道题具体而言:1.在此位置先放左括号,进行backTrack递归,就相当于以左括号为根节点生成一棵子多叉树,当走到if(left==0&&right==0)时就可以记录下“正确的组合”,否则在if(left>right)和if(left

@Jackwong0716 你好,我的理解是这样的,希望可以帮到你。1.traverse()函数返回值是void,所以不存在什么结束条件哦,这个if(s==n-1)判断的真正目的是当遍历到目的结点n-1时,将整个路径加到res中。2.没错,有的图节点不会指向n-1,这个时候就是for循环执行完,再执行函数最后一行的path.removeLast()就退出以该节点(此处该节点就是指,那些没指向n-1的图节点)的traverse函数,路径里面不需要该节点,因为他们无法到达n-1。3.如果if(s==n-1)判断里不path.removeLast(),即不把n-1节点从当前路径中删除,那么返回上层节点的时候,路径的末尾仍带着n-1节点,那么接下来新构造的路径就会出错,因为这是个递归的过程。

Hey guys, I think the reason for AP or AR is quite low might be caused by the inappropriate Cfg.burn_in in cfg.py. 1. When I use the default Cfg.burn_in=1000 as...

Thanks for your timely reply

Geniuely appreciate your reply and help(really happy :D)! I've tried setting different seed value and as well the TIME_DELTA as 0.3 to train the model the moment I finished reading...

WOW moment! It works just fine haha, many thanks for your kind help. I've trained the model for nearly 3 days so far, and the metrics currently show like this:...

Many thanks :P I've sent an email to your email adress **[email protected]_**, do you receive it? pls do check it, sincerely looking forward to your reply. @reiniscimurs

Have you ever tried using 360 degrees laser data(currently it's 180 degrees laser data and env_dim=20, which means 9 degrees a gap)? I changed it to 360 degrees range and...