dmnugent80

public class Solution {
    public int removeDuplicates(int[] A) {
        if (A.length == 0) return 0;
        
        int a = A[0];
        int count = 0;
        for (int i = 1; i < A.length; i++){
            if (a == A[i]){
                count++;
            }

dmnugent80

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

dmnugent80

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

dmnugent80

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {

dmnugent80

//Given a binary tree, return the postorder traversal of its nodes' values.

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

dmnugent80

public class Solution {
    public void rotate(int[] nums, int k) {
        if (k == 0) return;
        
        k = k % nums.length;
         
        reverse(nums, 0, nums.length-1);
        reverse(nums, 0, k-1);
        reverse(nums, k, nums.length-1);
        

dmnugent80

/**
 * Definition for an interval.
 * public class Interval {
 *     int start;
 *     int end;
 *     Interval() { start = 0; end = 0; }
 *     Interval(int s, int e) { start = s; end = e; }
 * }
 */
public class Solution {

dmnugent80

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }

dmnugent80

public class Solution {
    public int maxProfit(int[] prices) {
        if (prices.length == 0) return 0;
        
        int[] rearProfits = new int[prices.length];
        int maxPrice = prices[prices.length-1];
        int maxProfit = 0;
        int price = 0;
        for (int i = prices.length-2; i >= 0; i--){
            price = prices[i];

dmnugent80

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {