u014157400的博客

import java.util.LinkedList; /** * Definition for binary tree * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */ /...

* Evaluate the value of an arithmetic expression in Reverse Polish Notation. *Valid operators are+,-,*,/. Each operand may be an integer or another expression. *Some examples: * ["2", "1", "+", "...

Given n points on a 2D plane, find the maximum number of points that lie on the same straight line. /** * Definition for a point. * class Point { * int x; * int y; * Point() { x = 0...

冒泡： for(int i=0;i<arr.length-1;i++){//外层循环控制排序趟数 　　　　　　for(int j=0;j<arr.length-1-i;j++){//内层循环控制每一趟排序多少次 　　　　　　　　if(arr[j]>arr[j+1]){ 　　　　　　　　　　int temp=arr[j]; 　　　　　　　　　　arr[j]=arr[j+1]; 　...

  1.左，中，右，层次遍历 package BinaryTreeTraverseTest; import java.util.LinkedList; import java.util.Queue; /** * 二叉树的深度优先遍历和广度优先遍历 * @author Fantasy * @version 1.0 2016/10/05 - 2016/10/07 */ public cl...

反转链表： https://blog.youkuaiyun.com/guyuealian/article/details/51119499