【leetcode刷题笔记】算法向
Sidney_VonWunderland
学习~
展开
-
【leetcode刷题笔记】链表,数组
【leetcode刷题笔记】链表,数组两数之和class Solution { public int[] twoSum(int[] nums, int target) { for(int i = 0; i< nums.length; i ++){ for(int j = i+1; j < nums.length; j ++){ ...原创 2018-11-22 10:14:54 · 704 阅读 · 0 评论 -
【leetcode刷题笔记】动态规划
#【leetcode刷题笔记】动态规划石子游戏public boolean stoneGame(int[] piles) { int N = piles.length; // dp[i][j] is the score of Alex's maximum total score when remaining piles are from ith...原创 2018-11-23 18:18:16 · 294 阅读 · 0 评论