查看文件内容
Preview at 由第一行开始显示文件内容 tac 从最后一行开始显示,可以看出 tac 是 cat 的倒着写! nl 显示的时候,顺道输出行号! more 一页一页的显示文件内容 less 与 more 类似,但是比 more 更好的是,他可以往前翻页! head 只看头几行 tail 只看尾巴几行 od 以二进制的方式读取文件内容! cat (...
Preview at 由第一行开始显示文件内容 tac 从最后一行开始显示,可以看出 tac 是 cat 的倒着写! nl 显示的时候,顺道输出行号! more 一页一页的显示文件内容 less 与 more 类似,但是比 more 更好的是,他可以往前翻页! head 只看头几行 tail 只看尾巴几行 od 以二进制的方式读取文件内容! cat (...
LeetCode https://leetcode.cn/problems/merge-two-sorted-lists/ /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode() {} * ...
LeetCode https://leetcode.cn/problems/remove-nth-node-from-end-of-list/ /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode()...
LeetCode https://leetcode.cn/problems/linked-list-cycle-ii/ /** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * ...
LeetCode https://leetcode.cn/problems/remove-duplicates-from-sorted-list-ii/ /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListN...
LeetCode https://leetcode.cn/problems/sort-array-by-parity/ class Solution { public int[] sortArrayByParity(int[] nums) { int n = nums.length; int[] res = new int[n]; i...
LeetCode https://leetcode.cn/problems/delete-node-in-a-linked-list/ /** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x...
LeetCode https://leetcode.cn/problems/search-in-rotated-sorted-array/ class Solution { public int search(int[] nums, int target) { if (nums == null || nums.length == 0) { ...
LeetCode https://leetcode.cn/problems/powx-n/ class Solution { public double myPow(double x, int n) { if (x == 0 && n <= 0) { return -1; } else if (n &...
LeetCode https://leetcode.cn/problems/word-search/ class Solution { public boolean exist(char[][] board, String word) { int h = board.length, w = board[0].length; boolean[][] v...