https://www.cnblogs.com/yinq/p/6926581.html List排序大體上分為如下兩類: 1挟裂、List 對(duì)Integer铆铆、String等類型...
https://www.cnblogs.com/yinq/p/6926581.html List排序大體上分為如下兩類: 1挟裂、List 對(duì)Integer铆铆、String等類型...
https://www.cnblogs.com/lwlxqlccc/p/6143887.html 一、整理: 二县踢、Map與Collection在集合框架中屬并列存在 也就是C...
collection主要方法: boolean add(Object o)添加對(duì)象到集合boolean remove(Object o)刪除指定的對(duì)象int size()返回...
https://www.cnblogs.com/interdrp/p/8039490.html Stack的方法: boolean Empty() 測試堆棧...
https://leetcode.com/problems/valid-parentheses/description/解題思路:1.遇到配對(duì)的我們用stack來解決。 遇到...
https://leetcode.com/problems/linked-list-cycle/description/https://leetcode.com/proble...
https://leetcode.com/problems/add-binary/description/ 解題思路: 從最低位開始相加瓢颅,然后考慮進(jìn)位 代碼:class So...
https://leetcode.com/problems/balanced-binary-tree/description/ 解題思路:用前序判斷樹的高度亚再,然后對(duì)每一步判斷...
https://leetcode.com/problems/remove-duplicates-from-sorted-array/description/ 解題思路:num...
https://leetcode.com/problems/guess-number-higher-or-lower/description/解題思路:得到中間值去判斷 pu...
https://leetcode.com/problems/palindrome-number/description/ 解題思路: 反向相乘去得到目標(biāo)值reverse = ...
https://leetcode.com/problems/plus-one/description/解題思路:本位為9則進(jìn)位鼠锈,否則直接+1 代碼:class Solutio...
https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/descriptio...
https://leetcode.com/problems/search-insert-position/description/ class Solution {publi...
https://leetcode.com/problems/remove-duplicates-from-sorted-list/description/ 解題思路: 判斷前...
https://leetcode.com/problems/symmetric-tree/description/解題思路: node1. left == node2.rig...
https://leetcode.com/problems/remove-element/description/ 解題思路: nums[res++] == nums[i] ...
https://leetcode.com/problems/merge-two-sorted-lists/description/ class Solution {publi...
https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/description/解題...
https://leetcode.com/problems/missing-number/description/ 解題思路: 先排序闪檬,然后判斷nums[i] == i 代碼...