Esempio n. 1
0
 int all_sum(TreeNode* root, int &tot_tilt)
 {
     if(root == NULL)
         return 0;
     int lsum = all_sum(root->left, tot_tilt);
     int rsum = all_sum(root->right, tot_tilt);
     tot_tilt += abs(lsum - rsum);
     return root->val + lsum + rsum;
 }
Esempio n. 2
0
 int findTilt(TreeNode* root) {
     int ans = 0;
     all_sum(root, ans);
     return ans;
 }
Esempio n. 3
0
int main(int argc, char **argv)
{
  plan_tests(82);

  TCHAR buffer[64], *suggest;

  RadixTree<int> irt;
  irt.add(_T("foo"), 42);
  ok1(all_sum(irt) == 42);
  ok1(prefix_sum(irt, _T("")) == 42);
  ok1(prefix_sum(irt, _T("f")) == 42);
  ok1(prefix_sum(irt, _T("fo")) == 42);
  ok1(prefix_sum(irt, _T("foo")) == 42);
  ok1(prefix_sum(irt, _T("foobar")) == 0);

  irt.add(_T("foa"), 0);
  ok1(all_sum(irt) == 42);
  check_ascending_keys(irt);

  suggest = irt.suggest(_T("xyz"), buffer, 64);
  ok1(suggest == NULL);

  suggest = irt.suggest(_T(""), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("f")) == 0);

  suggest = irt.suggest(_T("f"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("o")) == 0);

  suggest = irt.suggest(_T("foo"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("")) == 0);

  irt.add(_T("bar"), 1);
  ok1(all_sum(irt) == 43);
  ok1(prefix_sum(irt, _T("")) == 43);
  ok1(prefix_sum(irt, _T("f")) == 42);

  suggest = irt.suggest(_T(""), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("bf")) == 0);

  suggest = irt.suggest(_T("ba"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("r")) == 0);

  irt.add(_T("foo"), 2);
  ok1(all_sum(irt) == 45);
  ok1(prefix_sum(irt, _T("")) == 45);
  ok1(prefix_sum(irt, _T("f")) == 44);
  ok1(prefix_sum(irt, _T("fo")) == 44);
  ok1(prefix_sum(irt, _T("foo")) == 44);
  ok1(prefix_sum(irt, _T("foobar")) == 0);

  suggest = irt.suggest(_T("foo"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("")) == 0);

  irt.add(_T("baz"), 3);
  ok1(all_sum(irt) == 48);
  ok1(prefix_sum(irt, _T("b")) == 4);
  ok1(prefix_sum(irt, _T("ba")) == 4);
  ok1(prefix_sum(irt, _T("bar")) == 1);
  ok1(prefix_sum(irt, _T("baz")) == 3);

  suggest = irt.suggest(_T(""), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("bf")) == 0);

  suggest = irt.suggest(_T("ba"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("rz")) == 0);

  irt.add(_T("foobar"), 4);
  ok1(all_sum(irt) == 52);
  ok1(prefix_sum(irt, _T("f")) == 48);
  ok1(prefix_sum(irt, _T("fo")) == 48);
  ok1(prefix_sum(irt, _T("foo")) == 48);
  ok1(prefix_sum(irt, _T("foobar")) == 4);

  suggest = irt.suggest(_T("foo"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("b")) == 0);

  irt.add(_T("fo"), 5);
  ok1(all_sum(irt) == 57);
  ok1(prefix_sum(irt, _T("f")) == 53);
  ok1(prefix_sum(irt, _T("fo")) == 53);
  ok1(prefix_sum(irt, _T("foo")) == 48);
  ok1(prefix_sum(irt, _T("foobar")) == 4);

  irt.add(_T("fooz"), 6);
  ok1(all_sum(irt) == 63);
  ok1(prefix_sum(irt, _T("f")) == 59);
  ok1(prefix_sum(irt, _T("fo")) == 59);
  ok1(prefix_sum(irt, _T("foo")) == 54);

  suggest = irt.suggest(_T("foo"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("bz")) == 0);

  irt.add(_T("fooy"), 7);
  ok1(all_sum(irt) == 70);
  ok1(prefix_sum(irt, _T("f")) == 66);
  ok1(prefix_sum(irt, _T("fo")) == 66);
  ok1(prefix_sum(irt, _T("foo")) == 61);

  suggest = irt.suggest(_T("foo"), buffer, 64);
  ok1(suggest != NULL);
  ok1(_tcscmp(suggest, _T("byz")) == 0);

  irt.add(_T("foo"), 8);
  ok1(all_sum(irt) == 78);
  ok1(prefix_sum(irt, _T("foo")) == 69);

  irt.remove(_T("foo"), 42);
  ok1(all_sum(irt) == 36);
  ok1(prefix_sum(irt, _T("foo")) == 27);

  irt.remove(_T("foo"));
  ok1(all_sum(irt) == 26);
  ok1(prefix_sum(irt, _T("")) == 26);
  ok1(prefix_sum(irt, _T("foo")) == 17);

  irt.add(_T(""), 9);
  ok1(all_sum(irt) == 35);
  ok1(prefix_sum(irt, _T("")) == 35);
  ok1(prefix_sum(irt, _T("foo")) == 17);

  check_ascending_keys(irt);

  return exit_status();
}